Concurrency, Synchronization, and Conflicts in Petri Nets
Journal
13th International Conference on Implementation and Application of Automata (CIAA 2008)
Pages
33-35
Date Issued
2008-07
Author(s)
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.
SDGs
Other Subjects
Chlorine compounds; Equivalence classes; Marine biology; Petri nets; Translation (languages); Boundedness problem; Concurrent systems; Equivalence problems; Extended Petri Nets; International conferences; Lower and upper bounds; Reachability problems; Graph theory
Type
conference paper