On the Expressiveness and Complexity of ATL
From MaRDI portal
Publication:3518283
DOI10.2168/LMCS-4(2:7)2008zbMath1143.68044MaRDI QIDQ3518283
Ghassan Oreiby, Nicolas Markey, François Laroussinie
Publication date: 7 August 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
model checkingtemporal logicmulti-agent systemsconcurrent game structuresalternating bisimulationalternating transition systems
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items
Differential Game Logic ⋮ Specification and Verification of Multi-Agent Systems ⋮ On Satisfiability in ATL with Strategy Contexts ⋮ Dependences in Strategy Logic ⋮ Where logic and agents meet ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Dependences in strategy logic ⋮ On the complexity of resource-bounded logics ⋮ Natural strategic ability ⋮ Reasoning about memoryless strategies under partial observability and unconditional fairness constraints