2026-07-20T05:27:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3356 2024-03-06T10:34:04Z ddc:004 open_access

Petri Net Reachability Graphs: Decidability Status of FO Properties Darondeau, Philippe Demri, Stéphane Meyer, Roland Morvan, Christophe Petri nets First order logic Reachability graph 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Philippe Darondeau and Stéphane Demri and Roland Meyer and Christophe Morvan 2011 Is Part Of LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2011.140 urn:nbn:de:0030-drops-33563 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.140 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode