What's decidable about hybrid automata?

Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify a boundary between decidability and undecidability for the reachability problem of hybrid automata. On the positive side, we give an (optimal) PSPACE reachability algorithm for the case of initialized rectangular automata, where all analog variables follow independent trajectories within piecewise-linear envelopes and are reinitialized whenever the envelope changes. Our algorithm is based on the construction of a timed automaton that contains all reachability information about a given initialized rectangular automaton. The translation has practical significance for verification, because it guarantees the termination of symbolic procedures for the reachability analysis of initialized rectangular automata. The translation also preserves the?-languages of initialized rectangular automata with bounded nondeterminism. On the negative side, we show that several slight generalizations of initialized rectangular automata lead to an undecidable reachability problem. In particular, we prove that the reachability problem is undecidable for timed automata augmented with a single stopwatch.

[1]  Editors , 1986, Brain Research Bulletin.

[2]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[3]  R. Lathe.  Phd by thesis , 1988, Nature.

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

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

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

[7]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

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

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

[10]  Nancy A. Lynch,et al.  Forward and backward simulations, part II: timing-based systems , 1993 .

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

[12]  Joseph Sifakis,et al.  On model checking for real-time properties with durations , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[13]  Pravin Varaiya,et al.  Suspension Automata: A Decidable Class of Hybrid Automata , 1994, CAV.

[14]  Ahmed Bouajjani,et al.  Verfying Invariance Properties of Timed Systems with Duration Variables , 1994, FTRTFT.

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

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

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

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

[19]  Ahmed Bouajjani,et al.  Verifying omega-Regular Properties for a Subclass of Linear Hybrid Systems , 1995, CAV.

[20]  Howard Wong-Toi,et al.  Automated Analysis of an Audio Control Protocol , 1995, CAV.

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

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

[23]  Simin Nadjm-Tehrani,et al.  Proving dynamic properties in an aerospace application , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[24]  Thomas A. Henzinger,et al.  Using HyTech to Synthesize Control Parameters for a Steam Boiler , 1995, Formal Methods for Industrial Applications.

[25]  Thomas A. Henzinger,et al.  HYTECH: the next generation , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[26]  James C. Corbett,et al.  Timing Analysis of Ada Tasking Programs , 1996, IEEE Trans. Software Eng..

[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]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1996, Inf. Comput..

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

[30]  Egon Börger,et al.  Formal methods for industrial applications : specifying and programming the steam boiler control , 1996 .

[31]  P. Kopke.  The Theory of Rectangular Hybrid Automata , 1996 .

[32]  Thomas Stauner,et al.  Using HYTECH to Verify an Automative Control System , 1997, HART.

[33]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[34]  Thomas A. Henzinger,et al.  Computing Accumulated Delays in Real-time Systems , 1993, Formal Methods Syst. Des..