Maximally permissive distributed supervisory control of nondeterministic discrete-event systems

In supervisor synthesis achieving nonblockingness is a major computational challenge for a large system. In the literature several automaton-based distributed synthesis approaches have been proposed, in which the plant is modeled by a collection of nondeterministic finite-state automata and the requirement and the final distributed supervisor are modeled by a collection of deterministic finite-state automata. In this paper we provide a sufficient condition, which guarantees maximal permissiveness of the synthesized distributed supervisor.