Extension based limited lookahead supervision of discrete event systems (Q1298307): Difference between revisions

The paper exploits the lookahead policies for supervisory control [introduced by \textit{S. L. Chung}, \textit{S. Lafortune} and \textit{F. Lin}, Discrete Event Dyn. Syst. 4, No. 3, 237-268 (1994; Zbl 0808.93001) and \textit{N. B. Hadj-Alouane}, \textit{S. Lafortune} and \textit{F. Lin}, IEEE Trans. Autom. Control 39, No. 12, 2398-2410 (1994; Zbl 0812.93003)] and considers extensions of the plant behavior by arbitrary traces beyond the limited lookahead window. The resulting supervisor is defined for each value of the number of lookahead steps. The construction of the supervisor relies on the concept of relative closure, so that it is non-blocking even if the desired behavior is not a relative closed language. The next control action is determined by computing the relative closed and controllable sublanguage of the estimated desired behavior with respect to the estimated plant dynamics. Compared with the limited lookahead policies, the proposed extension is in general less restrictive, and the complexity of the requested computation is of the same order. The approach is illustrated by its application to concurrency control of transactions in a simple database management system.