A Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata
Supervisory control is a logical control method of discrete event systems introduced by Ramadge and Wonham. We propose a novel coalgebraic formulation of a supervisory control problem and design a controller called supervisor satisfying a given specification under partial observations. In this paper, plants, specifications, and supervisors are modeled by Mealy automata, automata, and Moore automata, respectively. We define a composition of a supervisor and a plant coinductively, which is called a supervisory composition, to represent a behavior of the controlled plant. We formulate a supervisory control problem using the supervisory composition. We define two relations: a partial bisimulation relation and a modified normal relation. We show that these relations are related to the controllability/observability and the modified normality which are the key notions in the supervisory control theory.
Keywordsdiscrete event systems supervisory control coalgebra
Unable to display preview. Download preview PDF.
- 3.Hansen, H.: Coalgebraic Modelling: Applications in Automata theory and Modal logic. Ph.D. thesis (2009)Google Scholar
- 8.Rutten, J.: Coalgebra, concurrency and control. CWI. Software Engineering (SEN) (R 9921), 1–31 (1999)Google Scholar
- 10.Ushio, T., Takai, S.: Supervisory control of discrete event systems modeled by Mealy automata with nondeterministic output functions. In: American Control Conference, pp. 4260–4265 (2009)Google Scholar