Summary: The Discrete Time Behavior of Lazy Linear
Manindra Agrawal and P. S. Thiagarajan
School of Computing,
National University of Singapore
Abstract. 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 asso-
ciated with mode switchings take place with bounded delays.
The values of the continuous variables can be observed with only
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 vari-
ables during mode changes. In fact, our result holds for guard languages
that go well beyond linear constraints.
We present a class of linear hybrid automata and show that their discrete time