Using bisimulation to solve discrete event control problems

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.