Name
Abstract | ||
|---|---|---|
This paper shows that language based top-down supervisor synthesis of Ramadge-Wonham supervisory control theory is in general not feasible. We show this as a direct consequence of the undecidability result of Decomposable Subset problem (and its prefix closed version), which in turn is a corollary of the undecidability result of Trace Closed Subset problem. Essentially, it is in general not possible to decide in finite amount of time whether there exists a string in a regular language such that all those strings indistinguishable from it are contained in the same language. We bring these results to the attention of control community and investigate the decidability status of some other related problems. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ICARCV.2012.6485170 | 2012 12TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS & VISION (ICARCV) |
Keywords | Field | DocType |
distributed control, decomposable subset, supervisory control, top-down design | Supervisor,Discrete mathematics,Formal language,Algebra,Existential quantification,Computer science,Control theory,Supervisory control theory,Decidability,Prefix,Regular language,Corollary | Conference |
ISSN | Citations | PageRank |
2474-2953 | 1 | 0.37 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liyong Lin | 1 | 13 | 6.75 |
| Rong Su | 2 | 318 | 45.41 |
| Alin Stefanescu | 3 | 209 | 17.79 |