Yu Wang, Zhaohui Zhu, Rob van Glabbeek, Jinjin Zhang, Lixing Tan
{"title":"离散事件系统最大允许相似性控制的更多信息","authors":"Yu Wang, Zhaohui Zhu, Rob van Glabbeek, Jinjin Zhang, Lixing Tan","doi":"arxiv-2407.08068","DOIUrl":null,"url":null,"abstract":"Takai proposed a method for constructing a maximally permissive supervisor\nfor the similarity control problem (IEEE Transactions on Automatic Control,\n66(7):3197-3204, 2021). This paper points out flaws in his results by providing\na counterexample. Inspired by Takai's construction, the notion of a (saturated)\n(G, R)-automaton is introduced and metatheorems concerning (maximally\npermissive) supervisors for the similarity control problem are provided in\nterms of this notion. As an application of these metatheorems, the flaws in\nTakai's work are corrected.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"27 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"More on Maximally Permissive Similarity Control of Discrete Event Systems\",\"authors\":\"Yu Wang, Zhaohui Zhu, Rob van Glabbeek, Jinjin Zhang, Lixing Tan\",\"doi\":\"arxiv-2407.08068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Takai proposed a method for constructing a maximally permissive supervisor\\nfor the similarity control problem (IEEE Transactions on Automatic Control,\\n66(7):3197-3204, 2021). This paper points out flaws in his results by providing\\na counterexample. Inspired by Takai's construction, the notion of a (saturated)\\n(G, R)-automaton is introduced and metatheorems concerning (maximally\\npermissive) supervisors for the similarity control problem are provided in\\nterms of this notion. As an application of these metatheorems, the flaws in\\nTakai's work are corrected.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.08068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.08068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
Takai 提出了一种为相似性控制问题构建最大许可监督器的方法（IEEE Transactions on Automatic Control，66(7):3197-3204, 2021）。本文提供了一个反例，指出了其结果的缺陷。受高井构建的启发，本文引入了（饱和）(G, R)-自变量的概念，并根据这一概念提供了关于相似性控制问题（最大容许）监督器的元定理。作为这些元定理的应用，高井工作中的缺陷得到了纠正。
More on Maximally Permissive Similarity Control of Discrete Event Systems
Takai proposed a method for constructing a maximally permissive supervisor
for the similarity control problem (IEEE Transactions on Automatic Control,
66(7):3197-3204, 2021). This paper points out flaws in his results by providing
a counterexample. Inspired by Takai's construction, the notion of a (saturated)
(G, R)-automaton is introduced and metatheorems concerning (maximally
permissive) supervisors for the similarity control problem are provided in
terms of this notion. As an application of these metatheorems, the flaws in
Takai's work are corrected.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
