Efficient Computation of Supervisors for . . .

In this paper, we are interested in the control of a particular class of Concurrent Discrete Event Systems defined by a collection of components that interact with each other. We here consider the state avoidance control problem. We provide algorithms that, based on a particular decomposition of the set of forbidden states, locally solve the control problem (i.e. on each component without computing the whole system) and produce a global supervisor, that can be efficiently evaluated on the fly