Recent and simple algorithms for Petri nets

We show how inductive invariants can be used to solve coverability, boundedness and reachability problems for Petri nets. This approach provides algorithms that are conceptually simpler than previously published ones.

[1]  Zakaria Bouziane,et al.  A primitive recursive algorithm for the general Petri net reachability problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[2]  Jan K. Pachl.  Reachability problems for communicating finite state machines , 2003, ArXiv.

[3]  Yu-Fang Chen,et al.  Proceedings 12th International Workshop on Verification of Infinite-State Systems , 2010 .

[4]  Petr Jancar,et al.  Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm , 2008, Inf. Comput..

[5]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[6]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[7]  Grzegorz Rozenberg.  Advances in Petri Nets 1993 , 1991, Lecture Notes in Computer Science.

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

[9]  Richard J. Lipton,et al.  Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) , 1976, STOC '76.

[10]  Stéphane Demri,et al.  On selective unboundedness of VASS , 2010, J. Comput. Syst. Sci..

[11]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[12]  Philippe Schnoebelen,et al.  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[13]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[14]  Jean Goubault-Larrecq,et al.  Forward Analysis for WSTS, Part II: Complete WSTS , 2009, ICALP.

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

[16]  Jean Goubault-Larrecq,et al.  Forward analysis for WSTS, part I: completions , 2009, Mathematical Structures in Computer Science.

[17]  Pierre Ganty,et al.  Complexity Analysis of the Backward Coverability Algorithm for VASS , 2011, RP.

[18]  Jérôme Leroux.  Vector Addition Systems Reachability Problem (A Simpler Solution) , 2012, Turing-100.

[19]  Philippe Schnoebelen,et al.  Lossy Counter Machines Decidability Cheat Sheet , 2010, RP.