2012•Logical Methods in Computer ScienceOpen access

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Philippe Darondeau, Stéphane P. Demri, Roland Meyer, Christophe Morvan

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Decidability, Reachability, Undecidable problem, Petri net, Reachability problem, Computer science, Robustness (evolution), Stochastic Petri net