Reachability for Two-Counter Machines with One Test and One Reset

We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable by transitive closure. This approach generalizes and simplifies the existing different proofs and it solves an open problem introduced by Finkel and Sutre in 2000.

[1]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[2]  Rémi Bonnet.  The Reachability Problem for Vector Addition System with One Zero-Test , 2011, MFCS.

[3]  Alain Finkel,et al.  An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS , 2000, MFCS.

[4]  Supratik Chakraborty,et al.  On Petri Nets with Hierarchical Special Arcs , 2017, CONCUR.

[5]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

[6]  Patrick Totzke,et al.  What Makes Petri Nets Harder to Verify: Stack or Data? , 2017, Concurrency, Security, and Puzzles.

[7]  Patrick Totzke,et al.  Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete* , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[8]  Alain Finkel,et al.  Decidability of Reachability Problems for Classes of Two Counters Automata , 2000, STACS.

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

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

[11]  Klaus Reinhardt,et al.  Reachability in Petri Nets with Inhibitor Arcs , 2008, RP.

[12]  Alain Finkel,et al.  Place-Boundedness for Vector Addition Systems with one zero-test , 2010, FSTTCS.

[13]  Grégoire Sutre,et al.  Hyper-Ackermannian bounds for pushdown vector addition systems , 2014, CSL-LICS.

[14]  Alain Finkel,et al.  Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete , 2014, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[15]  Joël Ouaknine,et al.  Reachability in Succinct and Parametric One-Counter Automata , 2009, CONCUR.

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

[17]  Ranko Lazic.  The reachability problem for vector addition systems with a stack is not elementary , 2013, ArXiv.

[18]  Alain Finkel,et al.  Mixing Coverability and Reachability to Analyze VASS with One Zero-Test , 2010, SOFSEM.