What's decidable about hybrid automata?
Journal of Computer and System Sciences
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Model checking
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Journal of Computer and System Sciences
Succinct discrete time approximations of distributed hybrid automata
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Unfoldings: A Partial-Order Approach to Model Checking
Unfoldings: A Partial-Order Approach to Model Checking
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Hi-index | 5.23 |
We consider a network of controllers that observe and control a plant whose dynamics is determined by a finite set of continuous variables. At any given time a variable evolves at a constant rate. However, a controller can switch the rates of a designated subset of the continuous variables. These mode changes are determined by the current values of a designated subset of the variables that the controller can observe. Each variable's rate is controlled by exactly one controller and its value is observed by at most one controller. We model this setting as a network of hybrid automata and study its discrete time behavior. We show that the set of global control state sequences displayed by the network is regular. More importantly, we show that one can succinctly represent this regular language as a family of communicating finite state automata. We allow the observation of the variables and the changes in the rates of the variables to incur delays. We also permit the digital clocks associated with the controllers to evolve at different-but rationally related-rates.