The Discrete Time Behavior of Lazy Linear Hybrid Automata

We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: The observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. The values of the continuous variables can be observed with only finite precision. The guards controlling the transitions of the automaton are finite conjunctions of arbitrary linear constraints. We show that the discrete time dynamics of this class of automata can be effectively analyzed without requiring resetting of the continuous variables during mode changes. In fact, our result holds for guard languages that go well beyond linear constraints.

[1]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[2]  P. S. Thiagarajan,et al.  Lazy Rectangular Hybrid Automata , 2004, HSCC.

[3]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

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

[5]  Eugene Asarin,et al.  Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy , 1998, J. Comput. Syst. Sci..

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

[7]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[8]  John N. Tsitsiklis,et al.  Deciding stability and mortality of piecewise affine dynamical systems , 2001, Theor. Comput. Sci..

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

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

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

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

[13]  Joël Ouaknine,et al.  Revisiting digitization, robustness, and decidability for timed automata , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[14]  Thomas A. Henzinger,et al.  Hybrid Automata with Finite Bisimulatioins , 1995, ICALP.

[15]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

[16]  Thomas A. Henzinger,et al.  Discrete-Time Control for Rectangular Hybrid Automata , 1997, Theor. Comput. Sci..

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

[18]  Robert L. Grossman,et al.  Timed Automata , 1999, CAV.

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

[20]  Oded Maler,et al.  Hybrid and Real-Time Systems , 1997 .

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

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