https://scholars.lib.ntu.edu.tw/handle/123456789/502428
標題: | Normal and Sinkless Petri Nets. | 作者: | Howell, Rodney R. Rosier, Louis E. HSU-CHUN YEN |
公開日期: | 1989 | 起(迄)頁: | 234-243 | 來源出版物: | Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings | 摘要: | We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, they nonetheless are both capable of modeling a more interesting class of problems. On the other hand, we give strong evidence that normal and sinkless Petri nets are easier to analyze than persistent Petri nets. In so doing, we apply techniques originally developed for conflict-free Petri nets — a class defined solely in terms of the structure of the net — to sinkless Petri nets — a class defined in terms of the behavior of the net. As a result, we give the first comprehensive complexity analysis of a class of potentially unbounded Petri nets defined in terms of their behavior. © 1989, Springer-Verlag. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84886428419&doi=10.1007%2f3-540-51498-8_22&partnerID=40&md5=64d8c6703388aec958d22d160efe757a | DOI: | 10.1007/3-540-51498-8_22 | SDG/關鍵字: | Computation theory; Decision theory; Classical decision problems; Complexity analysis; Conflict free; Modeling power; Petri nets |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。