Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10413034 | Systems & Control Letters | 2005 | 6 Pages |
Abstract
In this paper, we present an algorithm for the computation of the controllable, normal sublanguage of a given language, encountered in the solution of the supervisory control of discrete-event systems under partial observation. The algorithm produces the desired result under certain assumptions on the plant and the event projection map. In particular, the plant has to be nonblocking. The advantage of the algorithm over the solution available in the literature is that it does not involve iterations on the supremal controllable sublanguage and supremal normal sublanguage operators.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
S. Hashtrudi Zad, M. Moosaei, W.M. Wonham,