Samenvatting
Recently supervisor synthesis for nondeterministic systems has gained more and more attention, owing to the potential computational advantage of using nondeterministic automata in modular/distributed synthesis. It is well known that, in the Ramadge/Wonham language-based supervisory control paradigm, the supremal nonblocking normal supervisor always exists (although may be empty) and is computable. In this paper we will show that, for a nondeterministic plant model and a deterministic specification, a similar entity called the supremal nonblocking state-normal supervisor also exists, which coincides with the supremal nonblocking normal supervisor when the plant model becomes deterministic. We then present a concrete algorithm to compute such a supervisor and analyze the relevant computational complexity.
Originele taal-2 | Engels |
---|---|
Titel | The 17th Mediterranean Conference on Control and Automation (MED'09), June 24-26, 2009, Thessaloniki Greece |
Plaats van productie | Piscataway |
Uitgeverij | Institute of Electrical and Electronics Engineers |
Pagina's | 1120-1125 |
ISBN van geprinte versie | 978-1-4244-4684-1 |
DOI's | |
Status | Gepubliceerd - 2009 |