A New Verification Algorithm for Inferencing in Supervisory Control of Discrete-Event Systems

Q3 Engineering IFAC-PapersOnLine Pub Date : 2024-01-01 DOI:10.1016/j.ifacol.2024.07.018
{"title":"A New Verification Algorithm for Inferencing in Supervisory Control of Discrete-Event Systems","authors":"","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":null,"pages":null},"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}
引用次数: 0

Abstract

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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
离散事件系统监督控制推理的新验证算法
我们提出了一种新算法,用于验证分散离散事件系统监督控制中的推理可观测性。该算法的成功依赖于以下理念。只有当语言不包含推理循环时,才存在推理解决方案。当不存在循环时,算法会计算推理解的最小上界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IFAC-PapersOnLine
IFAC-PapersOnLine Engineering-Control and Systems Engineering
CiteScore
1.70
自引率
0.00%
发文量
1122
期刊介绍: 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.
期刊最新文献
Torque-Minimizing Control Allocation for Overactuated Quadrupedal Locomotion Mesh Refinement with Early Termination for Dynamic Feasibility Problems Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case* Contents
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1