Synthesize nonblocking distributed supervisors with coordinators

In supervisor synthesis achieving nonblockingness is a major computational challenge when a target system consists of a large number of local components. To overcome this difficulty, for a distributed system consisting of a set of nondeterministic finite-state automata and a collection of deterministic specifications, we propose a synthesis approach that computes nonblocking distributed supervisors with coordinators by using a novel automaton abstraction technique