Philippe Darondeau ; Stephane Demri ; Roland Meyer ; Christophe Morvan - Petri Net Reachability Graphs: Decidability Status of First Order Properties

lmcs:872 - Logical Methods in Computer Science, October 22, 2012, Volume 8, Issue 4 - https://doi.org/10.2168/LMCS-8(4:9)2012
Petri Net Reachability Graphs: Decidability Status of First Order PropertiesArticle

Authors: Philippe Darondeau ; Stephane Demri ORCID; Roland Meyer ; Christophe Morvan

    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.


    Volume: Volume 8, Issue 4
    Published on: October 22, 2012
    Imported on: March 22, 2012
    Keywords: Computer Science - Logic in Computer Science,F.1.1,F.4.1

    5 Documents citing this article

    Consultation statistics

    This page has been seen 935 times.
    This article's PDF has been downloaded 576 times.