Remarks on the difficulty of top-down supervisor synthesis
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 o...
Saved in:
Main Authors: | Lin, Liyong., Su, Rong., Stefanescu, Alin. |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84647 http://hdl.handle.net/10220/11738 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Synthesis of covert actuator and sensor attackers as supervisor synthesis
by: Lin, Liyong, et al.
Published: (2021) -
Towards decentralized and parameterized supervisor synthesis
by: Lin, Liyong
Published: (2015) -
Synthesis of the supremal covert attacker against unknown supervisors by using observations
by: Tai, Ruochen, et al.
Published: (2023) -
Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis
by: Lin, Liyong, et al.
Published: (2022) -
The synthesis of time optimal supervisors by using heaps-of-pieces
by: Su, Rong., et al.
Published: (2013)