Semantics and Computability of the Evolution of Hybrid Systems

In this paper we consider the semantics for the evolution of hybrid systems, and the computability of the evolution with respect to these semantics. We show that with respect to lower semantics, the finite-time reachable sets are lower-semicomputable, and with respect to upper semantics, the finite-time reachable sets are upper-semicomputable. We use the framework of type-two Turing computability theory and computable analysis, which deal with obtaining approximation results with guaranteed error bounds from approximate data. We show that, in general, we cannot find a semantics for which the evolution is both lower- and upper-semicomputable, unless the system is free from tangential and corner contact with the guard sets. We highlight the main points of the theory with simple examples illustrating the subtleties involved.

[1]  J. Hespanha,et al.  Hybrid systems: Generalized solutions and robust stability , 2004 .

[2]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

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

[4]  Continuous Interpolation of Solutions of Lipschitz Inclusions , 2001 .

[5]  Thao Dang,et al.  d/dt: a verification tool for hybrid systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

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

[7]  Thomas Brihaye,et al.  On the expressiveness and decidability of o-minimal hybrid systems , 2005, J. Complex..

[8]  S. Sastry,et al.  On the existence of executions of hybrid automata , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[9]  J. Lygeros,et al.  Computability of finite-time reachable sets for hybrid systems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[10]  Lars Grüne,et al.  Optimal stabilization of hybrid systems using a set oriented approach , 2006 .

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

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

[13]  Jean-Pierre Aubin,et al.  Impulse differential inclusions: a viability approach to hybrid systems , 2002, IEEE Trans. Autom. Control..

[14]  Mireille E. Broucke,et al.  Continuous selections of trajectories of hybrid systems , 2002, Syst. Control. Lett..

[15]  Tiziano Villa,et al.  Ariadne: a framework for reachability analysis of hybrid automata , 2006 .

[16]  J. Aubin,et al.  Differential inclusions set-valued maps and viability theory , 1984 .

[17]  Thomas Brihaye,et al.  On O-Minimal Hybrid Systems , 2004, HSCC.

[18]  Stavros Tripakis,et al.  Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations , 2000, HSCC.

[19]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[20]  Thomas A. Henzinger,et al.  Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods , 2000, HSCC.

[21]  S. Shankar Sastry,et al.  O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..

[22]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[23]  Pieter Collins,et al.  A Trajectory-Space Approach to Hybrid Systems , 2004 .

[24]  George J. Pappas,et al.  Decidable Hybrid Systems , 1998 .

[25]  Julien Bect,et al.  Generalized Fokker-Planck equation for piecewise-diffusion processes with boundary hitting resets , 2006 .

[26]  O. Junge,et al.  The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems , 2001 .