Safety verification of non-linear hybrid systems is quasi-decidable

Safety verification of hybrid systems is undecidable, except for very special cases. In this paper, we circumvent undecidability by providing a verification algorithm that provably terminates for all robust problem instances, but need not necessarily terminate for non-robust problem instances. A problem instance x is robust iff the given property holds not only for x itself, but also when x is perturbed a little bit. Since, in practice, well-designed hybrid systems are usually robust, this implies that the algorithm terminates for the cases occurring in practice. In contrast to earlier work, our result holds for a very general class of hybrid systems, and it uses a continuous time model.

[1]  P. Olver.  Nonlinear Systems , 2013 .

[2]  Joost-Pieter Katoen,et al.  The Surprising Robustness of (Closed) Timed Automata against Clock-Drift , 2008, IFIP TCS.

[3]  T. Henzinger,et al.  Algorithmic Analysis of Nonlinear Hybrid Systems , 1998, CAV.

[4]  Anuj Puri.  Dynamical Properties of Timed Automata , 2000, Discret. Event Dyn. Syst..

[5]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

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

[7]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[8]  Ricardo G. Sanfelice,et al.  Hybrid Dynamical Systems: Modeling, Stability, and Robustness , 2012 .

[9]  Pieter Collins,et al.  Continuity and computability of reachable sets , 2005, Theor. Comput. Sci..

[10]  A I Bulgakov,et al.  Approximation of differential inclusions , 2002 .

[11]  Zdzisław Denkowski,et al.  Set-Valued Analysis , 2021 .

[12]  Ahmed Bouajjani,et al.  Perturbed Turing machines and hybrid systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[13]  Olivier Bournez,et al.  A Survey on Continuous Time Computations , 2009, ArXiv.

[14]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[15]  Martin Fränzle,et al.  What Will Be Eventually True of Polynomial Hybrid Automata? , 2001, TACS.

[16]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[17]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.

[18]  Rafal Goebel,et al.  Solutions to hybrid inclusions via set and graphical convergence with stability theory applications , 2006, Autom..

[19]  Stefan Ratschan,et al.  Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems , 2005, Int. J. Found. Comput. Sci..

[20]  Pieter Collins.  Semantics and Computability of the Evolution of Hybrid Systems , 2011, SIAM J. Control. Optim..

[21]  Emilio Frazzoli,et al.  Sampling-based resolution-complete safety falsification of linear hybrid systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[22]  Stefan Ratschan,et al.  Quantified Constraints Under Perturbation , 2002, J. Symb. Comput..

[23]  Stefan Ratschan.  Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable , 2010, TAMC.

[24]  Pravin Varaiya,et al.  Epsilon-Approximation of Differential Inclusions , 1996, Hybrid Systems.

[25]  Vijay Kumar,et al.  Sampling-based Falsification and Verification of Controllers for Continuous Dynamic Systems , 2008, Int. J. Robotics Res..

[26]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.