Widening the Boundary between Decidable and Undecidable Hybrid Systems

We revisited decidability of the reachability problem for low dimensional hybrid systems. Even though many attempts have been done to draw the boundary between decidable and undecidable hybrid systems there are still many open problems in between. In this paper we show that the reachability question for some two dimensional hybrid systems are undecidable and that for other 2-dim systems this question remains unanswered, showing that it is as hard as the reachability problem for Piecewise Affine Maps, that is a well known open problem.

[1]  Cristopher Moore,et al.  Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines , 1999, Theor. Comput. Sci..

[2]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[3]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[4]  Eugene Asarin,et al.  On some Relations between Dynamical Systems and Transition Systems , 1994, ICALP.

[5]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Michael S. Branicky,et al.  Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..

[8]  Michael A. Arbib,et al.  Discrete Mathematics: Applied Algebra for Computer and Information Science , 1974 .

[9]  Sampath Kannan,et al.  Polyhedral Flows in Hybrid Automata , 1999, HSCC.

[10]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[11]  Patricia Bouyer,et al.  Are Timed Automata Updatable? , 2000, CAV.

[12]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[13]  Karlis Cerans,et al.  Deciding Reachability for Planar Multi-polynomial Systems , 1996, Hybrid Systems.

[14]  Amir Pnueli,et al.  Reachability Analysis of Planar Multi-limear Systems , 1993, CAV.

[15]  Joseph Sifakis,et al.  An Approach to the Description and Analysis of Hybrid Systems , 1992, Hybrid Systems.

[16]  Pravin Varaiya,et al.  Decidability of Hybrid Systems with Rectangular Differential Inclusion , 1994, CAV.

[17]  Michael Henle,et al.  A combinatorial introduction to topology , 1978 .

[18]  Kārlis Čerāns,et al.  Algorithmic problems in analysis of real time system specifications , 1992 .

[19]  Michel Cosnard,et al.  Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..

[20]  Patricia Bouyer,et al.  Expressiveness of Updatable Timed Automata , 2000, MFCS.

[21]  R. Devaney.  An Introduction to Chaotic Dynamical Systems , 1990 .

[22]  Joseph Sifakis,et al.  Integration Graphs: A Class of Decidable Hybrid Systems , 1992, Hybrid Systems.

[23]  John N. Tsitsiklis,et al.  Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..

[24]  Sergio Yovine,et al.  On the Decidability of the Reachability Problem for Planar Differential Inclusions , 2001, HSCC.

[25]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

[27]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

[28]  Karl Henrik Johansson,et al.  Towards a Geometric Theory of Hybrid Systems , 2000, HSCC.

[29]  Leo F. Boron,et al.  Introduction to topological dynamics , 1975 .

[30]  Olivier Bournez.  Complexite algorithmique des systemes dynamiques continus et hybrides , 1999 .

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

[32]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.