On the complexity of practical ATL model checking

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 201-208

  Van Der Hoek, Wiebe ^a   Lomuscio, Alessio ^a   Wooldridge, Michael ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Complexity; Cooperation; Logic; Verification

Indexed keywords

FORMAL LANGUAGES; MODEL CHECKING; MULTI AGENT SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COALITION LOGIC; SIMPLE REACTIVE MODULES LANGUAGE (SRML);

COMPUTATIONAL COMPLEXITY;

EID: 34247255515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160665     Document Type: Conference Paper

References (25)

1. R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15(11):7-48, July 1999.
2. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, September 2002.
3. R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Taşjran. Mocha: Modularity in model checking. In CAV 1998: Tenth International Conference on Computer-aided Verification, (LNCS Volume 1427), pages 521-525. Springer-Verlag: Berlin, Germany, 1998.
4. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press: Cambridge, MA, 2000.
5. L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. The control of synchronous systems. In CONCUR 2000; Concurrency Theory, 11th International Conference (LNCS Volume 1877), pages 458-473. Springer-Verlag: Berlin, Germany, 2000.
6. L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. The control of synchronous systems part ii. In CONCUR 2001; Concurrency Theory, 12th International Conference (LNCS Volume 2154), pages 566-580. Springer-Verlag: Berlin, Germany, 2001.
7. G. van Drimmelen. Satisfiability in alternating-time temporal logic. In Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2003), pages 208-217, Ottawa, Canada, 2003.
8. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Volume B: Formal Models and Semantics, pages 996-1072. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, 1990.
9. V. Goranko. Coalition games and alternating temporal logics. In J. van Benthem, editor, Proceeding of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge (TARK VIII), pages 259-272, Siena, Italy, 2001.
10. J. Y. Halpern and M. Y. Vardi. Model checking versus theorem proving: A manifesto. In V. Lifschitz, editor, AI and Mathematical Theory of Computation - Papers in Honor of John McCarthy, pages 151-176. The Academic Press: London, England, 1991.
11. W. van der Hoek and M. Wooldridge. On the logic of cooperation and prepositional control. Artificial Intelligence, 164(1-2):81-119, May 2005.
12. G. Holzmann. The Spin model checker. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
13. W. Jamroga and J. Dix. Do agents make model checking explode (computationally)? In M. Pechoucek, P. Petta, and L. Z. Varga, editors, Multi-Agent Systems and Applications IV(LNAI Volume 3690), 2005.
14. W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Infomaticae, 63(2-3): 185-219, 2004.
15. M. Kacprzak and W. Penczek. A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic. Synthese, 142(2):203-227, November 2004.
16. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching time model checking. Journal of the ACM, 47(2):312-360, March 2000.
17. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers: Dordrecht, The Netherlands, 1993.
18. C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.
19. M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series 2001-10.
20. M. Pauly. A logical framework for coalitional effectivity in dynamic procedures. Bulletin of Economic Research, 53(4):305-324, 2002.
21. M. Pauly. A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1):149-166, 2002.
22. F. Raimondi and A. Lomuscio. The complexity of symbolic model checking temporal-epistemic logics. In Proceedings of Concurrency, Specification & Programming (CS&P), Ruciane-Nida, Poland, September 2005.
23. M. Ryan and P.-Y. Schobbens. Agents and roles: Refinement in alternating-time temporal logic. In J.-J. Ch. Meyer and M. Tambe, editors, Intelligent Agents VIII: Proceedings of the Eigth International Workshop on Agent Theories, Architectures, and Languages, ATAL-2001 (LNAI Volume 2333), pages 100-114, 2002.
24. L. J. Stockmeyer and A. K. Chandra. Provably difficult combinatorial games. SIAM Journal of Computing, 8(2): 151-174, 1979.
25. D. Walther, C. Lutz, F. Wolter, and M. Wooldridge. ATL satisfiability is indeed EXPTlME-complete, 2005. accepted for publication.