scholarly journals Alternating-time Temporal Logic on Finite Traces

2018 ◽  
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Aniello Murano ◽  
Sasha Rubin
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Optimal Algorithms ◽  
Branching Time ◽  
Multi Agent Systems ◽  
Perfect Recall ◽  
Agent Systems ◽  
Imperfect Recall ◽  
Multi Agent

We develop a logic-based technique to analyse finite interactions in multi-agent systems. We introduce a semantics for Alternating-time Temporal Logic (for both perfect and imperfect recall) and its branching-time fragments in which paths are finite instead of infinite.  We study validities of these logics and present optimal algorithms for their model-checking problems in the perfect recall case.

scholarly journals Formalizing Group and Propagated Trust in Multi-Agent Systems

2020 ◽  
Author(s):  
Nagat Drawel ◽  
Jamal Bentahar ◽  
Amine Laarej ◽  
Gaith Rjoub
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Reduction Technique ◽  
Branching Time ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Formal Framework ◽  
Multi Agent

We present a formal framework that allows individual and group of agents to reason about their trust toward other agents. In particular, we propose a branching time temporal logic BT which includes operators that express concepts such as everyone trust, distributed trust and propagated trust. We analyze the satisfiability and model checking problems of this logic using a reduction technique.

scholarly journals Unbounded Model Checking for ATL

2021 ◽  
Author(s):  
Michał Kański ◽  
Artur Niewiadomski ◽  
Magdalena Kacprzak ◽  
Wojciech Penczek ◽  
Wojciech Nabiałek
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Symbolic Model Checking ◽  
Experimental Results ◽  
Multi Agent Systems ◽  
Symbolic Model ◽  
Agent Systems ◽  
Multi Agent

In this paper, we deal with verification of multi-agent systems represented as concurrent game structures. To express properties to be verified, we use Alternating-Time Temporal Logic (ATL) formulas. We provide an implementation of symbolic model checking for ATL and preliminary, but encouraging experimental results.

scholarly journals Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications

2019 ◽  
Author(s):  
Jakub Michaliszyn ◽  
Piotr Witkowski
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Order Logic ◽  
Regular Expressions ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Interval Temporal Logic ◽  
Multi Agent ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Epistemic Halpern-Shoham logic (EHS) is an interval temporal logic defined to verify properties of Multi-Agent Systems. In this paper we show that the model checking Multi-Agent Systems with regular expressions against the EHS specifications is decidable. We achieve this by reducing the model checking problem to the satisfiability problem of Monadic Second-Order Logic on trees.

scholarly journals An Abstraction-Based Method for Verifying Strategic Properties in Multi-Agent Systems with Imperfect Information

2019 ◽  
Vol 33 ◽  
pp. 6030-6037
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Vadim Malvone
Keyword(s):  
Temporal Logic ◽  
Imperfect Information ◽  
Perfect Information ◽  
Multi Agent Systems ◽  
Perfect Recall ◽  
Agent Systems ◽  
Multi Agent ◽  
Refinement Procedure

We investigate the verification of Multi-agent Systems against strategic properties expressed in Alternating-time Temporal Logic under the assumptions of imperfect information and perfect recall. To this end, we develop a three-valued semantics for concurrent game structures upon which we define an abstraction method. We prove that concurrent game structures with imperfect information admit perfect information abstractions that preserve three-valued satisfaction. Further, we present a refinement procedure to deal with cases where the value of a specification is undefined. We illustrate the overall procedure in a variant of the Train Gate Controller scenario under imperfect information and perfect recall.

scholarly journals Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic

2017 ◽  
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Aniello Murano ◽  
Sasha Rubin
Keyword(s):  
Model Checking ◽  
Secret Sharing ◽  
Imperfect Information ◽  
Multi Agent Systems ◽  
Perfect Recall ◽  
Agent Systems ◽  
Multi Agent ◽  
Strategy Logic

We study a class of synchronous, perfect-recall multi-agent systemswith imperfect information and broadcasting (i.e., fully observableactions). We define an epistemic extension of strategy logic withincomplete information and the assumption of uniform and coherentstrategies. In this setting, we prove that the model checking problem,and thus rational synthesis, is decidable with non-elementarycomplexity. We exemplify the applicability of the framework on arational secret-sharing scenario.

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.

Sign in / Sign up

Export Citation Format

Share Document