Modular supervisory control of discrete-event systems (Q1113863)

The structure \(G=(Y,Q,d,q_ 0,Q_ m)\) is called a generator (or a process) where the symbols denote respectively: a finite set of output symbols (in distinction to the usually considered case of input symbols), a finite set of states, the transition function d: \(Y\times Q\to Q\), the initial state, and a subset \(Q_ m\subset Q\) of marker states. Discrete events mean state transitions from one state to the next state; with each transition a nondeterministic output is coupled. The language L(G), \(L(G)\subset Y^*\), is ``marked'' by G (in distinction to the usual case where ``accepted'' is used) if events end in the set of marker states \(Q_ m\). The control of the behaviour of G is performed by enabling or disabling the events. The basic problem of control is to synthesize a control strategy which allows a given language K to be marked by G. In this paper, the so-called modular approach to the supervisory control is studied in detail.