Computing exact automaton representations for a class of hybrid systems

Author

Niinomi, Toshihiko ; Krogh, Bruce H. ; Cury, José E R

Author_Institution

Mitsubishi Heavy Ind. Ltd., Hiroshima, Japan

Volume

1

fYear

1996

fDate

11-13 Dec 1996

Firstpage

144

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

continuous time systems; discrete event systems; discrete time systems; finite automata; formal languages; approximating automaton; discrete event systems; discrete-state supervisor; exact automaton representations; finite state automaton; hybrid system language; hybrid systems; outer approximation; standard synthesis methods; Automata; Control system synthesis; Detectors; Discrete event systems; Event detection; Signal generators; Signal synthesis; Supervisory control;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on

Conference_Location

Kobe

ISSN

0191-2216

Print_ISBN

0-7803-3590-2

Type

conf

DOI

10.1109/CDC.1996.574275

Filename

574275