Abstract
Petri nets represent one of the most popular formalisms for specifying, modeling, and analyzing concurrent systems. In spite of their popularity, many interesting problems concerning Petri nets are either undecidable or of very high complexity. Lipton [7] and Rackoff [10] showed exponential space lower and upper bounds, respectively, for the boundedness problem. As for the containment and the equivalence problems, Rabin [1] and Hack [5], respectively, showed these two problems to be undecidable. The reachability problem is known to be decidable [8] and exponential-space-hard [7].
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
References
Baker, H.: Rabin’s proof of the undecidability of the reachability set inclusion problem of vector addition systems, Computation Structures Group Memo 79, Project MAC, MIT (July 1973)
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)
Campeanu, C., Salomaa, K., Vagvolgyi, S.: Shuffle quotient and decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 223–226. Springer, Heidelberg (2002)
Garg, V., Raghunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science 96, 285–304 (1992)
Hack, M.: The equality problem for vector addition systems is undecidable. C.S.C. Memo 121, Project MAC, MIT (1975)
Ito, M.: Shuffle decomposition of regular languages. Journal of Universal Computer Science 8(2), 257–259 (2002)
Lipton, R.: The reachability problem requires exponential space, Technical Report 62, Yale University, Dept. of CS (January 1976)
Mayr, E.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238–246 (1981)
Peterson, J.: Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs (1981)
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science 6, 223–231 (1978)
Reisig, W.: Petri Nets: An Introduction. Springer, New York (1985)
Wolfsthal, Y., Yoeli, M.: An equivalence theorem for labeled marked graphs. IEEE Trans. on Parallel and Distributed Systems 5(8), 886–891 (1994)
Yen, H.: Sequential versus concurrent languages of labeled conflict-free Petri nets. IEEE Trans. on Automatic Control 47(7), 1158–1162 (2002)
Yen, H.: Introduction to Petri net theory. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, ch.14, vol. 25, pp. 343–373 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yen, HC. (2008). Concurrency, Synchronization, and Conflicts in Petri Nets. In: Ibarra, O.H., Ravikumar, B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70844-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-70844-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70843-8
Online ISBN: 978-3-540-70844-5
eBook Packages: Computer ScienceComputer Science (R0)