{"title":"可分解确定性无上下文规范语言的监控控制器综合","authors":"Kaushik Mallik, Anne-Kathrin Schmuck","doi":"10.1109/WODES.2016.7497821","DOIUrl":null,"url":null,"abstract":"In this paper we consider a supervisory control problem (SCP) consisting of a regular plant language and a deterministic context free specification language, where the latter can be decomposed into a regular and a deterministic context free part. For this setup we give an implementable algorithm calculating two separate controllers for each part of the specification. We show under which conditions the parallel composition of these controllers solves the original SCP. The latter is done by reducing the problem to a special case of hierarchical decentralized control and using existing results from the literature.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Supervisory controller synthesis for decomposable deterministic context free specification languages\",\"authors\":\"Kaushik Mallik, Anne-Kathrin Schmuck\",\"doi\":\"10.1109/WODES.2016.7497821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider a supervisory control problem (SCP) consisting of a regular plant language and a deterministic context free specification language, where the latter can be decomposed into a regular and a deterministic context free part. For this setup we give an implementable algorithm calculating two separate controllers for each part of the specification. We show under which conditions the parallel composition of these controllers solves the original SCP. The latter is done by reducing the problem to a special case of hierarchical decentralized control and using existing results from the literature.\",\"PeriodicalId\":268613,\"journal\":{\"name\":\"2016 13th International Workshop on Discrete Event Systems (WODES)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 13th International Workshop on Discrete Event Systems (WODES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2016.7497821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Workshop on Discrete Event Systems (WODES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2016.7497821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Supervisory controller synthesis for decomposable deterministic context free specification languages
In this paper we consider a supervisory control problem (SCP) consisting of a regular plant language and a deterministic context free specification language, where the latter can be decomposed into a regular and a deterministic context free part. For this setup we give an implementable algorithm calculating two separate controllers for each part of the specification. We show under which conditions the parallel composition of these controllers solves the original SCP. The latter is done by reducing the problem to a special case of hierarchical decentralized control and using existing results from the literature.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
