Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
