Computing exact automaton representations for a class of hybrid systems
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 144-147 vol.1
- https://doi.org/10.1109/cdc.1996.574275
Abstract
It is known that one can not always have a finite state representation for hybrid systems and many decision properties can be undecidable. It was shown in Cury et al. (1995), however, that if one has a finite state automaton that generates an outer approximation to the hybrid system language, it may be possible to synthesize a discrete-state supervisor to control the hybrid system based on the approximating automaton using standard synthesis methods from the theory of discrete event systems (DESs). In this paper we develop conditions under which the automaton generated by a modification of the approximation algorithm from Niinomi et al. (1996) generates the exact language for the hybrid system.Keywords
This publication has 5 references indexed in Scilit:
- Condition/event signal interfaces for block diagram modeling and analysis of hybrid systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Synthesis of supervisory controllers for hybrid systems based on approximating automataIEEE Transactions on Automatic Control, 1998
- Supervision of Infinite Behavior of Discrete-Event SystemsSIAM Journal on Control and Optimization, 1994
- On condition/event systems with discrete state realizationsDiscrete Event Dynamic Systems, 1991