Unbounded model checking for alternating-time temporal logic

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 2, Issue , 2004, Pages 646-653

  Kacprzak, M ^a   Penczek, W ^b  

^a BIALYSTOK UNIVERSITY OF TECHNOLOGY   (Poland)

^b POLISH ACADEMY OF SCIENCES   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING TIME TEMPORAL LOGIC (ATL); BINARY DECISION DIAGRAMS (BDD); MODEL CHECKING; QUANTIFIED BOOLEAN FORMULAS (QBF);

BOOLEAN ALGEBRA; CODES (SYMBOLS); COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA STORAGE EQUIPMENT; MATHEMATICAL OPERATORS; MULTI AGENT SYSTEMS; TRANSLATION (LANGUAGES);

FORMAL LOGIC;

EID: 4544292967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. R. Alur, L. de Alfaro, T. Henzinger, S. Krishnan, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. MOCHA user manual. Technical report, University of California at Berkeley, 2000. http://www-cad.eecs.berkeley.edu/~mocha/doc/c-doc/ c-manual.ps.gz.
2. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS'97), pages 100-109. IEEE Computer Society, October 1997.
3. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, 2002.
4. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-397, 1962.
6. V. Goranko. Coalition games and alternating temporal logics. In Proc. of the 8th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK VIII), pages 259-272. Morgan Kaufmann, 2001.
7. W. Jamroga. Some remarks on alternating temporal epistemic logic. In B. Dunin-Kȩplicz and R. Verbrugge, editors, Proc. of the Int. Workshop on Formal Approaches to Multi-Agent Systems (FAMAS'03), Fundamente Informaticae, 2004.
8. W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 2004. To appear.
9. M. Kacprzak, A. Lomuscio, and W. Penczek. Unbounded model checking for knowledge and time. Technical Report 966, ICS PAS, Ordona 21, 01-237 Warsaw, Decem-ber 2003. Also available at http://www.ipipan.waw.pl/ ~penczek/WPenczek/ 2003.html.
10. M. Kacprzak, A. Lomuscio, and W. Penczek. Verification of multi-agent systems via unbounded model checking. In Proc. of the 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS'04), July 2004. To appear.
11. T. Łasica, W. Penczek, and M. Szreter. Model checking multi-agent systems with VerICS. In Proc. of the 3rd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS III), LNCS. Springer-Verlag, 2004. To appear.
12. A. Lomuscio, T. Lasica, and W. Penczek. Bounded model checking for interpreted systems: Preliminary experimental results. In Proc. of the 2nd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'02), volume 2699 of LNAI, pages 115-125. Springer-Verlag, 2003.
13. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250-264. Springer-Verlag, 2002.
14. R. v. Meyden and H. Shilov. Model checking knowledge and time in systems with perfect recall. In Proceedings of Proc. of FST&TCS, volume 1738 of Lecture Notes in Computer Science, pages 432-445, Hyderabad, India, 1999.
15. W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2): 167-185, 2003.
16. W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. In T. Sandholm, editor, Proc. of the 2nd Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS'03), pages 209-216. ACM, July 2003.
17. F. Raimondi and A. Lomuscio. A tool for specification and verification of epistemic and temporal properties of multiagent system. Electronic Lecture Notes in Theoretical Computer Science, 2003. To appear.
18. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
19. W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proc. of the 9th Int. SPIN Workshop (SPIN'02), volume 2318 of LNCS, pages 95-111. Springer-Verlag, 2002.
20. W. van der Hoek and M. Wooldridge. Tractable multiagent planning for epistemic goals. In Proc. of the 1st Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS'02), volume III, pages 1167-1174. ACM, July 2002.
21. W. van der Hoek and M. Wooldridge. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica, 75(1): 125-157, 2003.
22. W. van der Hoek and M. Wooldridge. Model checking co-operation, knowledge, and time - a case study. Research in Economics, 57(3):235-265, 2003.
23. S. van Otterloo, W. van der Hoek, and M. Wooldridge. Knowledge as strategic ability. ENCTS, 85(2): 1-23, 2003.
24. M. Wooldridge, M. Fisher, M. Huget, and S. Parsons. Model checking multiagent systems with mable. In Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-02), Bologna, Italy, July 2002.