Abstract
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.
Original language | English |
---|---|
Title of host publication | 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1155-1160 |
Number of pages | 6 |
ISBN (Print) | 9781612848006 |
DOIs | |
Publication status | Published - 2011 |
Event | 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 - Orlando, FL, United States Duration: 12 Dec 2011 → 15 Dec 2011 |
Conference
Conference | 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 |
---|---|
Country/Territory | United States |
City | Orlando, FL |
Period | 12/12/11 → 15/12/11 |
Keywords
- automaton abstraction
- discrete-event systems
- distributed supervisor synthesis
- maximal permissiveness
- nondeterministic finite-state automata