Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40727
DC FieldValue
dc.titleThe discrete time behavior of lazy linear hybrid automata
dc.contributor.authorAgrawal, M.
dc.contributor.authorThiagarajan, P.S.
dc.date.accessioned2013-07-04T08:10:57Z
dc.date.available2013-07-04T08:10:57Z
dc.date.issued2005
dc.identifier.citationAgrawal, 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.
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40727
dc.description.abstractWe 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science
dc.description.volume3414
dc.description.page55-69
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

156
checked on Dec 8, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.