dc.contributor.authorLin, Liyong.
dc.contributor.authorSu, Rong.
dc.contributor.authorStefanescu, Alin.
dc.date.accessioned2013-07-17T06:34:35Z
dc.date.available2013-07-17T06:34:35Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationLin, 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.en_US
dc.identifier.urihttp://hdl.handle.net/10220/11738
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.rights© 2012 IEEE.en_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering
dc.titleRemarks on the difficulty of top-down supervisor synthesisen_US
dc.typeConference Paper
dc.contributor.conferenceInternational Conference on Control Automation Robotics & Vision (12th : 2012 : Guangzhou, China)en_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/ICARCV.2012.6485170


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record