A comparison of two Petri net types
1983
In this article we pick up a problem stated in [1], namely the question whether PNlog-nets allow to solve synchronization problems not solvable by ordinary Petri nets under certain simulation rules. We show that a slight and reasonable strengthening of the simulation rules defined in [1] enables us to answer the raised question in the positive. As will be pointed out in the introduction, with this result we “partially” solve the original problem.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
0
Citations
NaN
KQI