Abstract
We show that the cycles of a finite, bounded, reversible, and persistent Petri net can be decomposed in the following sense. There exists in the reachability graph a finite set of transition-disjoint cycles such that any other cycle through a given marking is permutation equivalent to a sequential composition of cycles from this set.
We show that Parikh images of cycles of a finite, bounded, and persistent Petri net form an additive monoid with a finite set of transition-disjoint generators (for any two distinct generators Ψ(γ) and Ψ(γ′), Ψ(γ)(t) = 0 or Ψ(γ′)(t) = 0 for every transition t).
Persistent nets are a very general class of conflict-free nets. Boundedness means, as usual, that the reachability graph is finite. Reversibility means that the reachability graph is strongly connected.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Darondeau, P.: Equality of Languages Coincides with Isomorphism of Reachable State Graphs for Bounded and Persistent Petri Nets. Information Processing Letters 94, 241–245 (2005)
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, 242 pages (1995) ISBN:0-521-46519-2
Grabowski, J.: The Decidability of Persistence for Vector Addition Systems. Information Processing Letter 11(1), 20–23 (1980)
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)
Stark, E.W.: Concurrent Transition Systems. TCS 64, 221–269 (1989)
Yamasaki, H.: On Weak Persistency of Petri Nets. Information Processing Letters 13(3), 94–97 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Darondeau, P. (2008). Decomposition Theorems for Bounded Persistent Petri Nets. In: van Hee, K.M., Valk, R. (eds) Applications and Theory of Petri Nets. PETRI NETS 2008. Lecture Notes in Computer Science, vol 5062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68746-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68746-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68745-0
Online ISBN: 978-3-540-68746-7
eBook Packages: Computer ScienceComputer Science (R0)