Please use this identifier to cite or link to this item:
|Title:||The discrete time behavior of lazy linear hybrid automata|
|Authors:||Agrawal, M. |
|Citation:||Agrawal, M.,Thiagarajan, P.S. (2005). The discrete time behavior of lazy linear hybrid automata. Lecture Notes in Computer Science 3414 : 55-69. ScholarBank@NUS Repository.|
|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 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. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.