The Algorithmic Analysis of Hybrid Systems

We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as finite automata equipped with variables that evolve continuously with time according to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted to linear hybrid systems. In particular, we consider symbolic model-checking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We also present approximation techniques for dealing with systems for which the iterative procedures do not converge.

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

[2]  Thomas A. Henzinger,et al.  Real-time system = discrete system + clock variables , 1994, International Journal on Software Tools for Technology Transfer.

[3]  T. Henzinger,et al.  Automatic Symbolic Veri cation of Embedded Systems , 1996 .

[4]  Nicolas Halbwachs,et al.  Delay Analysis in Synchronous Programs , 1993, CAV.

[5]  H. Le Verge,et al.  A Note on Chernikova's algorithm , 1992 .

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

[7]  Joseph Sifakis,et al.  Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[8]  David Lee,et al.  Online minimization of transition systems (extended abstract) , 1992, STOC '92.

[9]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[10]  Nicolas Halbwachs,et al.  Minimal Model Generation , 1990, CAV.

[11]  Thomas A. Henzinger,et al.  Model Checking Strategies for Linear Hybrid Systems , 1994 .

[12]  Zohar Manna,et al.  From Timed to Hybrid Systems , 1991, REX Workshop.

[13]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[14]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[15]  J. Davenport.  Editor , 1960 .

[16]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[17]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

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

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

[20]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[21]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[22]  H. L. Verge.  A Note on Chernikova's algorithm , 1992 .

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

[24]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[25]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[26]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[27]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[28]  Joseph Sifakis,et al.  Using Abstractions for the Verification of Linear Hybrid Systems , 1994, CAV.

[29]  Nancy G. Leveson,et al.  Software Requirements Analysis for Real-Time Process-Control Systems , 1991, IEEE Trans. Software Eng..

[30]  Nicolas Halbwachs,et al.  Verification of Linear Hybrid Systems by Means of Convex Approximations , 1994, SAS.