Skip to Main content Skip to Navigation
Journal articles

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Abstract : We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-00743935
Contributor : Christophe Morvan <>
Submitted on : Monday, October 22, 2012 - 10:20:31 AM
Last modification on : Wednesday, June 16, 2021 - 3:34:59 AM
Long-term archiving on: : Wednesday, January 23, 2013 - 3:35:45 AM

File

1210.2972.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (4:9), pp.1-28. ⟨10.2168/LMCS-8(4:9)2012⟩. ⟨hal-00743935⟩

Share

Metrics

Record views

511

Files downloads

1441