Petri Net Reachability Graphs: Decidability Status of FO Properties

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.
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 : mercredi 16 mai 2018 - 11:23:04

Identifiants

  • HAL Id : inria-00627657, version 1

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〉

Partager

Métriques

Consultations de la notice

345