Simulation of Zeno hybrid automata
Karl Henrik Johansson, John Lygeros, Shankar Sastry, Magnus Egerstedt · 2003
Zeno hybrid automata are hybrid systems that can exhibit infinitely many discrete transitions in a finite time interval. Such automata arise due to modeling simplifications and may deteriorate simulation efficiency and accuracy considerably. Some basic properties of Zeno hybrid automata are explored. Possible ways to extend a simulation beyond the Zeno time are suggested.