Abstract
The problem of synthesizing a nontrivial controllable and observable sublanguage of a given non-prefix-closed language is addressed. This problem arises in supervisory control of discrete-event systems, when the objective is to synthesize safe nonblocking supervisors for partially observed systems. The decentralized version of this problem is known to be unsolvable. We show that the centralized version of this problem is solvable by presenting a new algorithm that synthesizes a nontrivial controllable and observable sublanguage of the given non-prefix-closed language, if one exists. We also show that the union of all nonblocking solutions to the associated supervisory control problem can be expressed as the union of all regular nonblocking solutions.
| Original language | English |
|---|---|
| Pages (from-to) | 527-553 |
| Number of pages | 27 |
| Journal | Discrete Event Dynamic Systems: Theory and Applications |
| Volume | 16 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2006 |
Keywords
- Decidability
- Nonblocking
- Partial observation
- Supervisory control
Fingerprint
Dive into the research topics of 'Solvability of centralized supervisory control under partial observation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver