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 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 Automated Logical Verification based on Trace Abstractions

1995 ◽  
Vol 2 (53) ◽  
Author(s):  
Nils Klarlund ◽  
Mogens Nielsen ◽  
Kim Sunesen
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
State Space ◽  
Temporal Logic ◽  
Second Order ◽  
Order Logic ◽  
Verification Problem ◽  
Finite State ◽  
Second Order Logic ◽  
Monadic Second Order Logic

We propose a new and practical framework for integrating the behavioral<br />reasoning about distributed systems with model-checking methods.<br />Our proof methods are based on trace abstractions, which relate the<br />behaviors of the program and the specification. We show that for finite-state<br />systems such symbolic abstractions can be specified conveniently in<br />Monadic Second-Order Logic (M2L). Model-checking is then made possible<br />by the reduction of non-determinism implied by the trace abstraction.<br />Our method has been applied to a recent verification problem by Broy<br />and Lamport. We have transcribed their behavioral description of a distributed<br />program into temporal logic and verified it against another distributed<br />system without constructing the global program state space. The<br />reasoning is expressed entirely within M2L and is carried out by a decision<br />procedure. Thus M2L is a practical vehicle for handling complex temporal<br />logic specifications, where formulas decided by a push of a button are as<br />long as 10-15 pages.

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.

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes
Keyword(s):  
Model Checking ◽  
Lower Bounds ◽  
Expressive Power ◽  
Higher Order ◽  
Order Logic ◽  
High Complexity ◽  
Transition Systems ◽  
Recursive Formulas ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

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