Decentralized control of discrete event systems with bounded or unbounded delay communication

S. Tripakis
{"title":"Decentralized control of discrete event systems with bounded or unbounded delay communication","authors":"S. Tripakis","doi":"10.1109/WODES.2002.1167664","DOIUrl":null,"url":null,"abstract":"We introduce problems of decentralized control with delayed communication, where delays are either unbounded or bounded by a given constant k. In the k-bounded-delay model, between the transmission of a message and its reception, the plant can execute at most k events. In the unbounded-delay model, the plant can execute any number of events between transmission and reception. We show that our framework yields an infinite hierarchy of control problems, /spl Cscr//spl Cscr/ =/spl Dscr//spl Cscr//spl Cscr//sub 0//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 1//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 2//spl sup//spl middot//spl middot//spl middot//spl sup//spl Dscr//spl Cscr//spl Uscr//spl Cscr//spl sup//spl Dscr//spl Cscr/ , where CC is the set of control problems solvable with a single controller (centralized case) and /spl Dscr//spl Cscr//spl Cscr//sub k/ (resp. /spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/) is the set of problems solvable with two controllers in a k-bounded-delay network (resp. two controllers in an unbounded-delay network, two controllers without communication). The above containments are strict. We prove the undecidability of checking the existence of controllers in the unbounded-delay case, or in the case without any communication. Finally, we prove that a decentralized observation problem with bounded-delay communication is decidable.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"112","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167664","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 112

Abstract

We introduce problems of decentralized control with delayed communication, where delays are either unbounded or bounded by a given constant k. In the k-bounded-delay model, between the transmission of a message and its reception, the plant can execute at most k events. In the unbounded-delay model, the plant can execute any number of events between transmission and reception. We show that our framework yields an infinite hierarchy of control problems, /spl Cscr//spl Cscr/ =/spl Dscr//spl Cscr//spl Cscr//sub 0//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 1//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 2//spl sup//spl middot//spl middot//spl middot//spl sup//spl Dscr//spl Cscr//spl Uscr//spl Cscr//spl sup//spl Dscr//spl Cscr/ , where CC is the set of control problems solvable with a single controller (centralized case) and /spl Dscr//spl Cscr//spl Cscr//sub k/ (resp. /spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/) is the set of problems solvable with two controllers in a k-bounded-delay network (resp. two controllers in an unbounded-delay network, two controllers without communication). The above containments are strict. We prove the undecidability of checking the existence of controllers in the unbounded-delay case, or in the case without any communication. Finally, we prove that a decentralized observation problem with bounded-delay communication is decidable.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有有界或无界延迟通信的离散事件系统的分散控制
我们引入了具有延迟通信的分散控制问题,其中延迟要么是无界的,要么是由给定常数k限定的。在k有界延迟模型中,在消息的发送和接收之间,工厂可以执行最多k个事件。在无界延迟模型中,设备可以在发送和接收之间执行任意数量的事件。我们表明,框架收益率无限层次的控制问题,spl Cscr / / spl Cscr / = / spl Dscr / / spl Cscr / / spl Cscr / /子0 / / spl一口/ / spl Dscr / / spl Cscr / / spl Cscr / /子1 / / spl一口/ / spl Dscr / / spl Cscr / / spl Cscr / /子2 / / spl一口/ / spl压力/ / spl压力/ / spl压力/ / spl一口/ / spl Dscr / / spl Cscr / / spl Uscr / / spl Cscr / / spl一口/ / spl Dscr / / spl Cscr / CC在哪里的一组控制问题可以用一个控制器(集中)和/ spl Dscr / / spl Cscr / / spl Cscr / / sub k /(分别地。/spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/)是k-有界延迟网络中两个控制器可解的问题集。无边界延迟网络中的两个控制器(两个没有通信的控制器)。以上约束是严格的。证明了在无界延迟情况下和在无通信情况下,控制器是否存在的不可判定性。最后,我们证明了具有有界延迟通信的分散观测问题是可判定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Recent advances in discrete analysis and control of hybrid systems Algebraic and geometric characterization of Petri net controllers using the theory of regions Model predictive control for max-min-plus-scaling systems - efficient implementation Synthesis and implementation of local modular supervisory control for a manufacturing cell Strategic refinements in abstraction based supervisory control of hybrid systems
×
引用
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