离散事件系统监督控制推理的新验证算法

Q3 Engineering

IFAC-PapersOnLine Pub Date : 2024-01-01 DOI:10.1016/j.ifacol.2024.07.018

引用次数: 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.