DeepAI AI Chat
Log In Sign Up

Modelling and Verification of Reconfigurable Multi-Agent Systems

04/22/2021
by   Yehia Abd Alrahman, et al.
0

We propose a formalism to model and reason about reconfigurable multi-agent systems. In our formalism, agents interact and communicate in different modes so that they can pursue joint tasks; agents may dynamically synchronize, exchange data, adapt their behaviour, and reconfigure their communication interfaces. Inspired by existing multi-robot systems, we represent a system as a set of agents (each with local state), executing independently and only influence each other by means of message exchange. Agents are able to sense their local states and partially their surroundings. We extend LTL to be able to reason explicitly about the intentions of agents in the interaction and their communication protocols. We also study the complexity of satisfiability and model-checking of this extension.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/17/2022

R-CHECK: A Model Checker for Verifying Reconfigurable MAS

Reconfigurable multi-agent systems consist of a set of autonomous agents...
06/26/2019

A Computational Framework for Adaptive Systems and its Verification

Modern computer systems are inherently distributed and feature autonomou...
06/08/2021

Formal Verification of a Map Merging Protocol in the Multi-Agent Programming Contest

Communication is a critical part of enabling multi-agent systems to coop...
10/08/2014

Committment-Based Data-Aware Multi-Agent-Contexts Systems

Communication and interaction among agents have been the subject of exte...
04/19/2022

Model Checking Strategic Abilities in Information-sharing Systems

We introduce a subclass of concurrent game structures (CGS) with imperfe...
02/23/2018

Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Reconfigurable broadcast networks provide a convenient formalism for mod...
06/02/2023

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability

We consider the parameterized verification of arbitrarily large networks...