Relating Reachability Problems in Timed and Counter Automata

We establish a relationship between reachability problems in timed automata and spacebounded counter automata. We show that reachability in timed automata with three or more clocks is logarithmic-space inter-reducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmic-space equivalence of reachability in two-clock timed automata and space-bounded one-counter automata. This last reduction has recently been employed by Fearnley and Jurdzinski to settle the computational complexity of reachability in two-clock timed automata.

[1]  Alain Finkel,et al.  Reversal-Bounded Counter Machines Revisited , 2008, MFCS.

[2]  John Fearnley,et al.  Reachability in two-clock timed automata is PSPACE-Complete , 2013, ICALP 2013.

[3]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[4]  Joël Ouaknine,et al.  On the Relationship between Reachability Problems in Timed and Counter Automata , 2012, RP.

[5]  Patricia Bouyer,et al.  Robust Analysis of Timed Automata via Channel Machines , 2008, FoSSaCS.

[6]  Grégoire Sutre,et al.  Flat Counter Automata Almost Everywhere! , 2005, ATVA.

[7]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

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

[9]  Stéphane Demri,et al.  The Effects of Bounding Syntactic Resources on Presburger LTL , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

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

[11]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[12]  Parosh Aziz Abdulla,et al.  Decidability and Complexity Results for Timed Automata via Channel Machines , 2005, ICALP.

[13]  Hsu-Chun Yen,et al.  A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems , 1985, J. Comput. Syst. Sci..

[14]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[15]  Gerhard Goos,et al.  Automated Technology for Verification and Analysis , 2004, Lecture Notes in Computer Science.

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

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

[18]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

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

[20]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[21]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

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

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

[24]  Christoph Haase,et al.  On the complexity of model checking counter automata , 2012 .

[25]  John Fearnley,et al.  Reachability in two-clock timed automata is PSPACE-complete , 2013, Inf. Comput..

[26]  Markus Lohrey,et al.  Branching-Time Model Checking of One-Counter Processes and Timed Automata , 2013, SIAM J. Comput..

[27]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.