Verification of multi-agent systems with public actions against strategy logic
type: Item
instance of: scholarly article
title: Verification of multi-agent systems with public actions against strategy logic
zbMATH Open document ID: 1451.68290
author: Francesco Belardinelli
author: Alessio Lomuscio
author: Aniello Murano
author: Sasha Rubin
published in: Artificial Intelligence
publication date: 2020-08-06T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7229001
zbMATH Keywords: strategy logic
zbMATH Keywords: multi-agent systems
zbMATH Keywords: imperfect information
zbMATH Keywords: verification
zbMATH Keywords: formal methods
describes a project that uses: EVE
describes a project that uses: VerICS
describes a project that uses: MCMAS
describes a project that uses: MOCHA
describes a project that uses: MCMAS-SLK
MaRDI profile type: Publication
full work available at URL: j.artint.2020.103302
OpenAlex ID: W3024446676
cites work: A Modal Logic for Coalitional Power in Games
cites work: Alternating-time temporal logic
cites work: Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
cites work: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
cites work: Strategy logic
cites work: Reasoning about strategies
cites work: Reasoning About Strategies
cites work: Q2980973
cites work: Practical verification of multi-agent systems against \textsc{Slk} specifications
cites work: Q5506377
cites work: Q4461756
cites work: On the semantics of strategy logic
cites work: Dependences in Strategy Logic
cites work: A logic with revocable and refinable strategies
cites work: An Epistemic Strategy Logic
cites work: Decision algorithms for multiplayer noncooperative games of incomplete information
cites work: Distributed Synthesis for Alternating-Time Logics
cites work: Hierarchical Information Patterns and Distributed Strategy Synthesis
cites work: Q5144683
cites work: Q4845472
cites work: CONCUR 2005 – Concurrency Theory
cites work: Dynamic Epistemic Logic and Knowledge Puzzles
cites work: Epistemic planning for single- and multi-agent systems
cites work: Synthesis with rational environments
cites work: Reasoning about equilibria in game-like concurrent systems
cites work: Imperfect information in reactive modules games
cites work: Q3576736
cites work: Q4681371
cites work: Graded modalities in strategy logic
cites work: Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
cites work: Rational secret sharing and multiparty computation
cites work: The Logic of Animal Conflict
cites work: Q5111630
cites work: Q5357709
cites work: Equilibria of concurrent games on event structures
cites work: Q5801633
cites work: Q5801632
cites work: Optimal Bluffing Strategies in Poker
cites work: One hundred prisoners and a light bulb
cites work: Q3126969
cites work: Deciding full branching time logic
cites work: Quantified CTL: Expressiveness and Complexity
cites work: Augmenting ATL with strategy contexts
cites work: The complementation problem for Büchi automata with applications to temporal logic
DOI: 10.1016/J.ARTINT.2020.103302
description: scientific article; zbMATH DE number 7229001