Continuous Petri Nets: Expressive Power and Decidability Issues
Recalde, Laura; Haddad, Serge; Silva, Manuel (2007), Continuous Petri Nets: Expressive Power and Decidability Issues, in Namjoshi, Kedar; Yoneda, Tomohiro; Higashino, Teruo; Okamura, Yoshio, Automated Technology for Verification and Analysis 5th International Symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 Proceedings, Springer : Berlin, p. 362-377. http://dx.doi.org/10.1007/978-3-540-75596-8_26
TypeCommunication / Conférence
Conference title5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007
Book titleAutomated Technology for Verification and Analysis 5th International Symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 Proceedings
Book authorNamjoshi, Kedar; Yoneda, Tomohiro; Higashino, Teruo; Okamura, Yoshio
Series titleLecture Notes in Computer Science
Number of pages566
MetadataShow full item record
Abstract (EN)State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected gains are twofold: improvements in comlexity and in decidability. This paper concentrates on the study of decidability issues. In the case of autonomous nets it is proved that properties like reachability, liveness or deadlock-freeness remain decidable. When time is introduced in the model (using an infinite server semantics) decidability of these properties is lost, since continuous timed Petri nets are able to simulate Turing machines.
Subjects / KeywordsPetri nets
Showing items related by title and author.