Document Open Access Logo

Petri Net Reachability Graphs: Decidability Status of FO Properties

Authors Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2011.140.pdf
  • Filesize: 0.5 MB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Petri nets
  • First order logic
  • Reachability graph

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Philippe Darondeau, Stéphane Demri, Roland Meyer, and Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 140-151, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.FSTTCS.2011.140

Author Details

Philippe Darondeau
Stéphane Demri
Roland Meyer
Christophe Morvan
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact