Thumbnail

Continuous Petri Nets: Expressive Power and Decidability Issues

Recalde, Laura; Haddad, Serge; Silva, Manuel (2007), Continuous Petri Nets: Expressive Power and Decidability Issues, dans 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

Voir/Ouvrir
Type
Communication / Conférence
Date
2007
Titre du colloque
5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007
Date du colloque
2007-10
Ville du colloque
Tokyo
Pays du colloque
Japon
Titre de l'ouvrage
Automated Technology for Verification and Analysis 5th International Symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 Proceedings
Auteurs de l’ouvrage
Namjoshi, Kedar; Yoneda, Tomohiro; Higashino, Teruo; Okamura, Yoshio
Éditeur
Springer
Titre de la collection
Lecture Notes in Computer Science
Numéro dans la collection
4762
Ville d’édition
Berlin
Isbn
978-3-540-75595-1
Nombre de pages
566
Pages
362-377
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Recalde, Laura
Haddad, Serge
Silva, Manuel
Résumé (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.
Mots-clés
Petri nets