Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

https://hal.inria.fr/inria-00627657
Contributor : Christophe Morvan Connect in order to contact the contributor
Submitted on : Tuesday, May 25, 2021 - 11:16:03 AM
Last modification on : Saturday, June 25, 2022 - 9:15:37 PM
Long-term archiving on: : Thursday, August 26, 2021 - 6:53:03 PM

File

DDMM-fsttcs11.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : inria-00627657, version 1

Citation

Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India. ⟨inria-00627657⟩

Share

Metrics

Record views

203

Files downloads

27