By Topic

Computing exact automaton representations for a class of hybrid systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Niinomi, T. ; Mitsubishi Heavy Ind. Ltd., Hiroshima, Japan ; Krogh, B.H. ; Cury, J.E.R.

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

Published in:

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on  (Volume:1 )

Date of Conference:

11-13 Dec 1996