Petri Net Reachability Graphs: Decidability Status of FO Properties

Philippe Darondeau 1 Stephane Demri 2 Roland Meyer 3 Christophe Morvan 4
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 LSV - Laboratoire Spécification et Vérification [Cachan]
3 CTG - Concurrency Theory Group
4 VERTECS - Verification models and techniques applied to testing and control of reactive systems
Inria Rennes – Bretagne Atlantique
Abstract : We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order, modal and pattern-based languages without labels on transitions or atomic propositions on markings. We consider several parameters to separate decidable problems from undecidable ones. Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques.
Keywords : Petri nets First order logic Reachability graph
Type de document :
Communication dans un congrès
Supratik Chakraborty and Amit Kumar. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2011, Bombay, India. Dagstuhl Publishing, 2011, Leibniz International Proceedings in Informatics (LIPICS)
Liste complète des métadonnées
https://hal.inria.fr/inria-00627657
Contributeur : Christophe Morvan <>
Soumis le : jeudi 29 septembre 2011 - 11:50:20
Dernière modification le : vendredi 16 novembre 2018 - 01:21:56

Identifiants

  • HAL Id : inria-00627657, version 1

Collections

INRIA | UNIV-RENNES1 | IRISA | IRISA-D4 | ENS-CACHAN | TDS-MACS | UR1-UFR-ISTIC | UNIV-RENNES

Citation

Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. Supratik Chakraborty and Amit Kumar. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2011, Bombay, India. Dagstuhl Publishing, 2011, Leibniz International Proceedings in Informatics (LIPICS). 〈inria-00627657〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

351

Contact


archive-ouverte@inria.fr