Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 17th Mediterranean Conference on Control and Automation, MED '09, Thessaloniki, Greece, 24-26 June 2009 |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1108-1113 |
ISBN (Print) | 978-1-4244-4684-1 |
DOIs | |
Publication status | Published - 2009 |