A coalgebraic approach to supervisory control of partially observed mealy automata

  • Authors:
  • Jun Kohjina;Toshimitsu Ushio;Yoshiki Kinoshita

  • Affiliations:
  • Graduate School of Engineering Science, Osaka University, Japan;Graduate School of Engineering Science, Osaka University, Japan;National Institute of Advanced Industrial Science and Technology, Japan

  • Venue:
  • CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.