https://scholars.lib.ntu.edu.tw/handle/123456789/342602
Title: | Concurrency, Synchronization, and Conflicts in Petri Nets | Authors: | HSU-CHUN YEN | Issue Date: | Jul-2008 | Start page/Pages: | 33-35 | Source: | 13th International Conference on Implementation and Application of Automata (CIAA 2008) | 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. |
URI: | http://scholars.lib.ntu.edu.tw/handle/123456789/342602 | DOI: | 10.1007/978-3-540-70844-5_4 | SDG/Keyword: | 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 |
Appears in Collections: | 電機工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.