Using bisimulation to solve discrete event control problems

Author

Barrett, George ; Lafortune, Stéphane

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

Volume

4

fYear

1997

fDate

4-6 Jun 1997

Firstpage

2337

Abstract

A fundamental relationship between the controllability of a language with respect to another language and a set of uncontrollable events in the supervisory control theory of Ramadge and Wonham (1987) and bisimulation of automata models is derived. The theoretical results relating bisimulation to controllability support an efficient solution to the basic supervisory control problem. Utilizing the bisimulation property of language controllability and derived relationships between automata languages and input/output finite-state machine behaviors, a similarity is revealed between supervisory control theory and the system-theoretic problem posed by DiBenedetto et al. (1994, 1995, 1996) called strong I/O FSM model matching

Keywords

controllability; discrete event systems; finite state machines; formal languages; automata languages; automata models; bisimulation; discrete event control problems; input/output finite-state machine behaviors; language controllability; supervisory control theory; uncontrollable events; Automata; Automatic control; Control systems; Controllability; Discrete event systems; Supervisory control;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 1997. Proceedings of the 1997

Conference_Location

Albuquerque, NM

ISSN

0743-1619

Print_ISBN

0-7803-3832-4

Type

conf

DOI

10.1109/ACC.1997.609068

Filename

609068