×

An algorithm for computing the mask value of the supremal normal sublanguage of a legal language. (English) Zbl 0833.93006

The problem of computing the supremal normal sublanguage of a legal language is an intermediate step to the solution of the supervisory control problem under partial observations for discrete event systems introduced by Ramage and Wonham. There are two main algorithms for the solution of the supervisory problem: the one of Wonham and Ramage, which requires the mask value of the supremal language and the one of Cho and Markus. The authors list five algorithms for the computation of the supremal sublanguage, including their own, introduced in the present paper. Each of those can be used in conjunction with any of the main algorithms. According to the authors, the most suitable for the Wonham and Ramage algorithm is theirs; it derives the mask value of the supremal language with less effort. The number of intermediate automata produced is two, whereas, for the other algorithms, it ranges from three to seven.

MSC:

93A13 Hierarchical systems
93B40 Computational methods in systems theory (MSC2010)
93C30 Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)
PDFBibTeX XMLCite
Full Text: DOI