Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Best, E., Darondeau, P.: Decomposition Theorems for Bounded Persistent Petri Nets. In: van Hee, K., Valk, R.(eds.) Proc. of ATPN 2008, Xi’An (to appear, 2008)
Best, E., Darondeau, P., Wimmel, H.: Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae 80, 75–90 (2007)
Best, E., Esparza, J., Wimmel, H., Wolf, K.: Separability in Conflict-free Petri Nets. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 1–18. Springer, Heidelberg (2007)
Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked Directed Graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, 242 pages (1995) ISBN:0-521-46519-2
Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. In: Tse-Yun, F. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102–112. Springer, Heidelberg (1975)
Landweber, L.H., Robertson, E.L.: Properties of Conflict-Free and Persistent Petri Nets. JACM 25(3), 352–364 (1978)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Best, E. (2008). A Note on Persistent Petri Nets. In: Degano, P., De Nicola, R., Meseguer, J. (eds) Concurrency, Graphs and Models. Lecture Notes in Computer Science, vol 5065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68679-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-68679-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68676-7
Online ISBN: 978-3-540-68679-8
eBook Packages: Computer ScienceComputer Science (R0)