scholarly journals A Compositional Automata-based Approach for Model Checking Multi-Agent Systems

2008 ◽  
Vol 195 ◽  
pp. 133-149
Author(s):  
Mario Benevides ◽  
Carla Delgado ◽  
Carlos Pombo ◽  
Luis Lopes ◽  
Ricardo Ribeiro
Keyword(s):  
Model Checking ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

scholarly journals Modelling and verification of reconfigurable multi-agent systems

2021 ◽  
Vol 35 (2) ◽  
Author(s):  
Yehia Abd Alrahman ◽  
Nir Piterman
Keyword(s):  
Model Checking ◽  
Communication Protocols ◽  
Local State ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Robot Systems ◽  
Message Exchange ◽  
Multi Agent ◽  
Exchange Data ◽  
Multi Robot

AbstractWe 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.

scholarly journals Model Checking Temporal Epistemic Logic under Bounded Recall

2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu
Keyword(s):  
Model Checking ◽  
Incomplete Information ◽  
Epistemic Logic ◽  
Upper Bounds ◽  
Experimental Results ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Bounded Recall

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.

Model checking temporal knowledge and commitments in multi-agent systems using reduction

2015 ◽  
Vol 51 ◽  
pp. 45-68 ◽  
Author(s):  
Faisal Al-Saqqar ◽  
Jamal Bentahar ◽  
Khalid Sultan ◽  
Wei Wan ◽  
Ehsan Khosrowshahi Asl
Keyword(s):  
Model Checking ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

Abstraction for model checking multi-agent systems

2010 ◽  
Vol 5 (1) ◽  
pp. 14-25 ◽  
Author(s):  
Conghua Zhou ◽  
Bo Sun ◽  
Zhifeng Liu
Keyword(s):  
Model Checking ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document