Free choice Petri nets
Properties of Conflict-Free and Persistent Petri Nets
Journal of the ACM (JACM)
A Fundamental Tehoerem of Asynchronous Parallel Computation
Proceedings of the Sagamore Computer Conference on Parallel Processing
Making Petri Nets Safe and Free of Internal Transitions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Decomposition Theorems for Bounded Persistent Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Journal of Computer and System Sciences
Separability in conflict-free petri nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
On persistent reachability in Petri nets
Information and Computation
| Hi-index | 0.00 |
Petri nets have traditionally been motivated by their ability to express concurrency. Subclasses of Petri nets with concurrency but without choices or conflicts have been studied extensively. One of the best known - and comparatively restricted - such class are the marked graphs [4]. However, perhaps the largest class of (intuitively) choice-free nets are the persistent nets [7], a class of nets that is significantly larger than marked graphs.Some early results about persistent nets are Keller's theorem [6], which will be recalled in a later part of this paper, and the famous semilinearity result of Landweber and Robertson [7], which states that the set of reachable markings of a persistent net is semilinear. In this paper, we show that in bounded persistent nets, the smallest cycles of its reachability graph enjoy a uniqueness property.