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]. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Yen, H. C. (2008). Concurrency, synchronization, and conflicts in Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5148 LNCS, pp. 33–35). https://doi.org/10.1007/978-3-540-70844-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
