Alternating-time temporal logic
Journal of the ACM (JACM)
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The Control of Synchronous Systems, Part II
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Coalition games and alternating temporal logics
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
ATL with Strategy Contexts and Bounded Memory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
On the expressiveness and complexity of ATL
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Resource-bounded alternating-time temporal logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
A framework for coalitional normative systems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Model checking strategic abilities of agents under incomplete information
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
Atl is a logic for multi-agent systems that enjoys model checking linear in the size of the models. Here, we point out that the size of an atl model is usually exponential in the number of agents. We establish the precise atl model checking complexity when the number of agents is considered a parameter: it turns out that the problem is Σ2P-complete for concurrent game structures, and NP-complete for alternating transition systems. We also show that atl model checking over the broader class of nondeterministic alternating transition systems is still NP-complete, which suggests that using the more general class of models may be convenient in practice.