Quantitatively nonblocking supervisory control of discrete-event systems

IF 4.8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Automatica Pub Date : 2024-08-31 DOI:10.1016/j.automatica.2024.111879
{"title":"Quantitatively nonblocking supervisory control of discrete-event systems","authors":"","doi":"10.1016/j.automatica.2024.111879","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose a new property of <em>quantitative nonblockingness</em> of an automaton with respect to a given cover on its set of marker states. This property <em>quantifies</em> the standard nonblocking property by capturing the practical requirement that every subset (i.e. cell) of marker states can be reached within a prescribed number of steps from any reachable state and following any trajectory of the system. Accordingly, we formulate a new problem of quantitatively nonblocking supervisory control, and characterize its solvability in terms of a new concept of quantitative language completability. It is proven that there exists the unique supremal quantitatively completable sublanguage of a given language, and we develop an effective algorithm to compute the supremal sublanguage. Finally, combining with the algorithm of computing the supremal controllable sublanguage, we design an algorithm to compute the maximally permissive solution to the formulated quantitatively nonblocking supervisory control problem.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S000510982400373X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a new property of quantitative nonblockingness of an automaton with respect to a given cover on its set of marker states. This property quantifies the standard nonblocking property by capturing the practical requirement that every subset (i.e. cell) of marker states can be reached within a prescribed number of steps from any reachable state and following any trajectory of the system. Accordingly, we formulate a new problem of quantitatively nonblocking supervisory control, and characterize its solvability in terms of a new concept of quantitative language completability. It is proven that there exists the unique supremal quantitatively completable sublanguage of a given language, and we develop an effective algorithm to compute the supremal sublanguage. Finally, combining with the algorithm of computing the supremal controllable sublanguage, we design an algorithm to compute the maximally permissive solution to the formulated quantitatively nonblocking supervisory control problem.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
离散事件系统的定量无阻塞监督控制
在本文中,我们提出了一种新的自动机定量无阻塞性属性,它与自动机标记状态集上的给定覆盖相关。这一属性量化了标准的非阻塞性,它捕捉到了这样一个实际要求,即每个标记状态子集(即单元)都能在规定的步数内从任意可到达状态到达,并遵循系统的任意轨迹。因此,我们提出了一个新的定量无阻塞监督控制问题,并用定量语言可完备性这一新概念来描述其可解性。我们证明了存在给定语言的唯一超定量可完备性子语言,并开发了计算超定量子语言的有效算法。最后,结合计算至上可控子语言的算法,我们设计了一种算法来计算所提出的定量无阻塞监督控制问题的最大允许解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Automatica
Automatica 工程技术-工程:电子与电气
CiteScore
10.70
自引率
7.80%
发文量
617
审稿时长
5 months
期刊介绍: Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field. After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience. Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.
期刊最新文献
Deep networks for system identification: A survey Linear–quadratic mean-field game for stochastic systems with partial observation Modelling of memristor networks and the effective memristor Equi-normalized robust positively invariant sets for linear difference inclusions Adaptive event-triggered output feedback control for uncertain parabolic PDEs
×
引用
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