Abstract
We introduce the class of lazy rectangular hybrid automata. The key feature of this class is that both the observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. 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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Agrawal, M., & Thiagarajan, P. S. (2004). Lazy rectangular hybrid automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 1–15. https://doi.org/10.1007/978-3-540-24743-2_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
