Mutually non-blocking supervisory control of discrete event systems
Martin Fabian, Ratnesh Kumar · 2002
A single maximally permissive and nonblocking supervisor to simultaneously fulfill several marked specification languages pertaining to a single plant, is investigated. It is shown that a supervisor guaranteeing that the controlled system can execute traces within one specification while always being able to continue into the traces of the other does exist. Given a plant G and two marked specification languages K/sub 1/ and K/sub 2/, a supervisor S is said to be (K/sub 1/, K/sub 2/)-mutually nonblocking if L/sub m/(G/spl par/S)/spl cap/K/sub i//spl sube/L/sub m/(G/spl par/S)/spl cap/K/sub j/ for i,j=1,2. This means that when the closed-loop system marks a trace of K/sub i/, then it is always able to continue to a trace of K/sub j/, also marked in the closed-loop system. In this way the controlled system can execute traces within one specification while always being able to continue into the traces of the other and thus not blocking the other specification. We will show that a complete, globally nonblocking and (K/sub 1/, K/sub 2/)-mutually nonblocking supervisor such that L/sub m/(G/spl par/S)/spl sube/K/sub 1//spl cup/K/sub 2/ exists if and only if there exists a controllable mutually nonblocking sublanguage of the union of the specification. There does exist a unique supremal such language. Furthermore, in the case that each specification language is nonconflicting with respect to the prefix-closure of the other, this supremal language can be calculated in a modular fashion, by expressing it as a union of the supremal prefix-bounded sub-languages of the respective specifications.