{"title":"离散事件系统监督控制推理的新验证算法","authors":"C.K. Sharpe , S.H. Yoon , S.L. Ricker , H. Marchand","doi":"10.1016/j.ifacol.2024.07.018","DOIUrl":null,"url":null,"abstract":"<div><p>We present a new algorithm to verify inference observability in supervisory control of decentralized discrete-event systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language contains no inferencing cycles. When there are no cycles, the algorithm computes the smallest upper bound for an inferencing solution.</p></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"58 1","pages":"Pages 102-107"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S240589632400096X/pdf?md5=e02358e1fcca87fa7d307a0ff4e7625f&pid=1-s2.0-S240589632400096X-main.pdf","citationCount":"0","resultStr":"{\"title\":\"A New Verification Algorithm for Inferencing in Supervisory Control of Discrete-Event Systems\",\"authors\":\"C.K. Sharpe , S.H. Yoon , S.L. Ricker , H. Marchand\",\"doi\":\"10.1016/j.ifacol.2024.07.018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present a new algorithm to verify inference observability in supervisory control of decentralized discrete-event systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language contains no inferencing cycles. When there are no cycles, the algorithm computes the smallest upper bound for an inferencing solution.</p></div>\",\"PeriodicalId\":37894,\"journal\":{\"name\":\"IFAC-PapersOnLine\",\"volume\":\"58 1\",\"pages\":\"Pages 102-107\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S240589632400096X/pdf?md5=e02358e1fcca87fa7d307a0ff4e7625f&pid=1-s2.0-S240589632400096X-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IFAC-PapersOnLine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S240589632400096X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IFAC-PapersOnLine","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S240589632400096X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
A New Verification Algorithm for Inferencing in Supervisory Control of Discrete-Event Systems
We present a new algorithm to verify inference observability in supervisory control of decentralized discrete-event systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language contains no inferencing cycles. When there are no cycles, the algorithm computes the smallest upper bound for an inferencing solution.
期刊介绍：
All papers from IFAC meetings are published, in partnership with Elsevier, the IFAC Publisher, in theIFAC-PapersOnLine proceedings series hosted at the ScienceDirect web service. This series includes papers previously published in the IFAC website.The main features of the IFAC-PapersOnLine series are: -Online archive including papers from IFAC Symposia, Congresses, Conferences, and most Workshops. -All papers accepted at the meeting are published in PDF format - searchable and citable. -All papers published on the web site can be cited using the IFAC PapersOnLine ISSN and the individual paper DOI (Digital Object Identifier). The site is Open Access in nature - no charge is made to individuals for reading or downloading. Copyright of all papers belongs to IFAC and must be referenced if derivative journal papers are produced from the conference papers. All papers published in IFAC-PapersOnLine have undergone a peer review selection process according to the IFAC rules.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
