Please use this identifier to cite or link to this item:
|Title:||Succinct discrete time approximations of distributed hybrid automata|
|Authors:||Thiagarajan, P.S. |
|Keywords:||Discrete time approximation|
Distributed hybrid automata
|Source:||Thiagarajan, P.S.,Yang, S. (2010). Succinct discrete time approximations of distributed hybrid automata. HSCC'10 - Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control : 1-10. ScholarBank@NUS Repository. https://doi.org/10.1145/1755952.1755955|
|Abstract:||We consider a network of hybrid automata that observe and control a plant whose state space is determined by a finite set of continuous variables. We assume that at any instant, these variables are evolving at (possibly different) constant rates. Each automaton in the network controls-i.e. can switch the rates of-a designated subset of the continuous variables without having to reset their values. These mode changes are determined by the current values of a designated subset of the variables that the automaton can observe. We require the variables controlled-in terms of effecting mode changes - by different hybrid automata to be disjoint. However, the same variable may be observed by more than one automaton. We study the discrete time behavior of such networks of hybrid automata. We show that the set of global control state sequences displayed by the network is regular. More importantly, we show that one can effectively and succinctly represent this regular language as a product of local finite state automata. © 2010 ACM.|
|Source Title:||HSCC'10 - Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 18, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.