Solvability of Centralized Supervisory Control Under Partial Observation

  • Authors:
  • Tae-Sic Yoo;Stéphane Lafortune

  • Affiliations:
  • Idaho National Laboratory, Idaho Falls, USA 83403-2528;Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, USA 48109---2122

  • Venue:
  • Discrete Event Dynamic Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of synthesizing a nontrivial controllable and observable sublanguage of a given non-prefix-closed language is addressed. This problem arises in supervisory control of discrete-event systems, when the objective is to synthesize safe nonblocking supervisors for partially observed systems. The decentralized version of this problem is known to be unsolvable. We show that the centralized version of this problem is solvable by presenting a new algorithm that synthesizes a nontrivial controllable and observable sublanguage of the given non-prefix-closed language, if one exists. We also show that the union of all nonblocking solutions to the associated supervisory control problem can be expressed as the union of all regular nonblocking solutions.