Effective Computation of an Lm(G)-Closed, Controllable, and Observable Sublanguage Arising in Supervisory Control

  • Authors:
  • Shigemasa Takai;Toshimitsu Ushio

  • Affiliations:
  • -;-

  • Venue:
  • WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study nonblocking supervisory control of discrete event systems under partial observation. A nonblocking supervisor can be synthesized for the supremal Lm(G)-closed, controllable, and normal sublanguage of a given (non-closed) marked language. However, such a supervisor may be too restrictive as a solution to the supervisory control problem. We identify a subclass of observable sublanguages of a given language, which has the supremal element larger than the supremal normal sublanguage. By using the supremal element, we present an iterative algorithm for computing an Lm(G)-closed, controllable, and observable sublanguage of a given marked language, which is larger than the supremal Lm(G)-closed, controllable, and normal sublanguage.