常规开放团队的反抽象

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-09-16 DOI:10.1016/j.ipl.2024.106533

Shabana A.T., Alphy George, S. Sheerazuddin

{"title":"常规开放团队的反抽象","authors":"Shabana A.T., Alphy George, S. Sheerazuddin","doi":"10.1016/j.ipl.2024.106533","DOIUrl":null,"url":null,"abstract":"<div>We study open swarms and teams of multi-agent systems where agents may join or leave the system at runtime. Kouvaros et al. [1] defined the verification problem for such systems and showed it to be undecidable, in general. Also, they have found one decidable class of open multi-agent systems and provided a partial decision procedure for another. In the same vein we present a subclass of open teams called regular open teams for which reachability is decidable. This is shown by employing a counter abstraction technique wherein the regular open team is abstracted into a finite state multi-counter system.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106533"},"PeriodicalIF":0.7000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Counter abstraction for regular open teams\",\"authors\":\"Shabana A.T., Alphy George, S. Sheerazuddin\",\"doi\":\"10.1016/j.ipl.2024.106533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>We study open swarms and teams of multi-agent systems where agents may join or leave the system at runtime. Kouvaros et al. [1] defined the verification problem for such systems and showed it to be undecidable, in general. Also, they have found one decidable class of open multi-agent systems and provided a partial decision procedure for another. In the same vein we present a subclass of open teams called regular open teams for which reachability is decidable. This is shown by employing a counter abstraction technique wherein the regular open team is abstracted into a finite state multi-counter system.</div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"188 \",\"pages\":\"Article 106533\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000632\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000632","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

我们研究的是多代理系统的开放群和团队，其中的代理可以在运行时加入或离开系统。Kouvaros 等人[1]定义了这类系统的验证问题，并证明它在一般情况下是不可判定的。此外，他们还发现了一类可判定的开放式多代理系统，并为另一类系统提供了部分决策程序。同样，我们提出了一个开放团队的子类，称为常规开放团队，其可达性是可判定的。我们采用了一种计数器抽象技术，将常规开放团队抽象为有限状态多计数器系统，从而证明了这一点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Counter abstraction for regular open teams

We study open swarms and teams of multi-agent systems where agents may join or leave the system at runtime. Kouvaros et al. [1] defined the verification problem for such systems and showed it to be undecidable, in general. Also, they have found one decidable class of open multi-agent systems and provided a partial decision procedure for another. In the same vein we present a subclass of open teams called regular open teams for which reachability is decidable. This is shown by employing a counter abstraction technique wherein the regular open team is abstracted into a finite state multi-counter system.

求助全文

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

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.