https://scholars.lib.ntu.edu.tw/handle/123456789/342602
標題: | Concurrency, Synchronization, and Conflicts in Petri Nets | 作者: | HSU-CHUN YEN | 公開日期: | 七月-2008 | 起(迄)頁: | 33-35 | 來源出版物: | 13th International Conference on Implementation and Application of Automata (CIAA 2008) | 摘要: | 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/關鍵字: | 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 |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。