Please use this identifier to cite or link to this item:
|Title:||Remarks on the difficulty of top-down supervisor synthesis||Authors:||Lin, Liyong.
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering||Issue Date:||2012||Source:||Lin, L., Su, R., & Stefanescu, A. (2012). Remarks on the difficulty of top-down supervisor synthesis. 2012 12th International Conference on Control Automation Robotics & Vision (ICARCV), 270-275.||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.||URI:||https://hdl.handle.net/10356/84647
|DOI:||10.1109/ICARCV.2012.6485170||Rights:||© 2012 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Conference Papers|
Updated on Mar 10, 2021
Page view(s) 50515
Updated on Jun 26, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.