Handbook of theoretical computer science (vol. B)
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Symbolic Model Checking
Alternating-time temporal logic
Journal of the ACM (JACM)
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Agents and Roles: Refinement in Alternating-Time Temporal Logic
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Satisfiability in Alternating-time Temporal Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Coalition games and alternating temporal logics
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
On the logic of cooperation and propositional control
Artificial Intelligence
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Do agents make model checking explode (computationally)?
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Passive verification of the strategyproofness of mechanisms in open environments
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the logic of normative systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Resource-bounded alternating-time temporal logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Annals of Mathematics and Artificial Intelligence
Selective approaches for solving weak games
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The complexity of model checking concurrent programs against CTLK specifications
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
A computationally grounded dynamic logic of agency, with an application to legal actions
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiability checking is EXPTIME-complete for "full" ATL, and PSPACE-complete (in the general case) for the fragment of ATL corresponding to Pauly's Coalition Logic. In contrast, the model checking problems for ATL and Coalition Logic can both be solved in time polynomial in the size of the formula and the size of model against which the formula is to be checked. However, these latter results assume an extensive representation of models, in which all states of a model are explicitly enumerated. Such representations are not feasible in practice. In this paper we investigate the complexity of the ATL and Coalition Logic model checking problems for a more "reasonable" model representation known as SRML ("Simple Reactive Modules Language"), a simplified version of the actual model representation languages used for model checkers such as SMV and MOCHA. While it is unsurprising that, when measured against such representations, the model checking problems for ATL and Coalition Logic have a higher complexity than when measured against explicit state representations, we show that in fact the ATL and Coalition Logic model checking problems for SRML models have the same complexity as the corresponding satisfiability problems. That is, model checking ATL formulae against SRML models is EXPTIME-complete, and model checking Coalition Logic formulae against SRML models is PSPACE-complete. We conclude by investigating some technical issues around these results, and discussing their implications.