Petri Net Reachability Graphs: Decidability Status of First Order Properties

We investigate the decidability and complexity status of model-checking prob- lems 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.

[1]  M. Praveen,et al.  Small Vertex Cover makes Petri Net Coverability and Boundedness Easier , 2010, Algorithmica.

[2]  Marius Bozga,et al.  Fast Acceleration of Ultimately Periodic Relations , 2010, CAV.

[3]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[4]  Albert R. Meyer,et al.  The Complexity of the Finite Containment Problem for Petri Nets , 1981, JACM.

[5]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[6]  Tadao Kasami,et al.  Some Decision Problems Related to the Reachability Problem for Petri Nets , 1976, Theor. Comput. Sci..

[7]  Michael A. Ivanov.  Diophantine equations , 2004 .

[8]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[9]  Jérôme Leroux,et al.  Vector addition system reachability problem: a short self-contained proof , 2011, POPL '11.

[10]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[11]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[12]  P. Madhusudan,et al.  Model-checking trace event structures , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[13]  P. S. Thiagarajan,et al.  An Event Structure Semantics for General Petri Nets , 1996, Theor. Comput. Sci..

[14]  Grégoire Sutre,et al.  On Flatness for 2-Dimensional Vector Addition Systems with States , 2004, CONCUR.

[15]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[16]  Dirk Hauschildt.  Semilinearity of the reachability set is decidable for Petri nets , 1990 .

[17]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[18]  Michel Hack,et al.  The Equality Problem for Vector Addition Systems is Undecidable , 1976, Theor. Comput. Sci..

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[20]  Stefan Schulz.  First-Order Logic with Reachability Predicates on Infinite Systems , 2010, FSTTCS.

[21]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[22]  Elisabeth Pelz.  Closure Properties of Deterministic Petri Nets , 1987, STACS.

[23]  D. Gabbay.  Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .

[24]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[25]  Jérôme Leroux.  Vector Addition System Reversible Reachability Problem , 2013, Log. Methods Comput. Sci..

[26]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[27]  Alain Finkel,et al.  Cyclic Petri net reachability sets are semi-linear effectively constructible , 1997, INFINITY.

[28]  Dov M. Gabbay,et al.  EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[29]  Jan Grabowski,et al.  The Decidability of Persistence for Vector Addition Systems , 1980, Information Processing Letters.

[30]  Rüdiger Valk,et al.  Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..

[31]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[32]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[33]  Peter Habermehl.  On the Complexity of the Linear-Time mu -calculus for Petri-Nets , 1997, ICATPN.

[34]  Hubert Comon-Lundh,et al.  Diophantine Equations, Presburger Arithmetic and Finite Automata , 1996, CAAP.

[35]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[36]  Tadao Kasami,et al.  Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets , 1977, Theor. Comput. Sci..

[37]  Mohamed Faouzi Atig,et al.  On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..

[38]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[39]  Rodney R. Howell,et al.  Completeness Results for Single-Path Petri Nets , 1993, Inf. Comput..

[40]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[41]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[42]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.