Simulation of Zeno Hybrid Automata 1 2

Zeno hybrid automata are hybrid systems that can exhibit in nitely many discrete transitions in a nite time interval. Such automata arise due to modeling simplications and may deteriorate simulation e ciency and accuracy considerably. Some basic properties of Zeno hybrid automata are explored. Possible ways to extend a simulation beyond the Zeno time are suggested.

[1]  Akash Deshpande,et al.  The SHIFT programming language for dynamic networks of hybrid automata , 1998 .

[2]  V. Borkar,et al.  A unified framework for hybrid control , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[3]  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).

[4]  Paul Gastin,et al.  On the Power of Non-Observable Actions in Timed Automata , 1996, STACS.

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

[6]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[7]  Sven Erik Mattsson,et al.  On Object-Oriented Modelling of Relays and Sliding Mode Behaviour , 1996 .

[8]  M. Egerstedt,et al.  On the regularization of Zeno hybrid automata , 1999 .

[9]  Pieter J. Mosterman,et al.  Sliding Mode Model Semantics and Simulation for Hybrid Systems , 1997, Hybrid Systems.

[10]  A. J. van der Schaft,et al.  Complementarity modeling of hybrid systems , 1998, IEEE Trans. Autom. Control..

[11]  Mats Andersson,et al.  Object-Oriented Modeling and Simulation of Hybrid Systems , 1994 .

[12]  Thomas A. Henzinger,et al.  Modularity for Timed and Hybrid Systems , 1997, CONCUR.

[13]  M. K. Camlibel,et al.  Uniqueness of solutions of relay systems , 1997 .