Verifying multi-agent systems via unbounded model checking

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3228, Issue , 2004, Pages 189-212

  Kacprzak, M ^a   Lomuscio, A ^b   Lasica, T ^c   Penczek, W ^c,d   Szreter, M ^c  

^a BIALYSTOK UNIVERSITY OF TECHNOLOGY   (Poland)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c POLISH ACADEMY OF SCIENCES   (Poland)

^d SIEDLCE UNIVERSITY OF NATURAL SCIENCES AND HUMANITIES   (Poland)

Author keywords

Model checking; Multi agent systems; Unbounded model checking

Indexed keywords

CONTROL EQUIPMENT; SEMANTICS;

MODEL CHECKING; SYMBOLIC MODEL CHECKING; UNBOUNDED MODEL CHECKING;

MULTI AGENT SYSTEMS;

EID: 26444618229     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30960-4_13     Document Type: Conference Paper

References (23)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS'99, volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.
2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001.
3. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
4. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-397, 1962.
5. P. Dembiński, A. Janowska, P. Janowski, W. Penczek, A. Pólrola, M. Szreter, B. Woźna, and A. Zbrzezny. VerICS: A tool for verifying Timed Automata and Estelle specifications. In Proc. of the 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), volume 2619 of LNCS, pages 278-283. Springer-Verlag, 2003.
6. E. A. Emerson and E. M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. of the 7th Int. Colloquium on Automata, Languages and Programming (ICALP'80), volume 85 of LNCS, pages 169-181. Springer-Verlag, 1980.
7. E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
8. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.
9. J. Halpern and M. Vardi. Model checking vs. theorem proving: a manifesto, pages 151-176. Artificial Intelligence and Mathematical Theory of Computation. Academic Press, Inc, 1991.
10. 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.
11. 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.
12. R. van der 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.
13. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference (DAC'01), pages 530-535, June 2001.
14. W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2): 167-185, 2003.
15. F. Raimondi and A. Lomuscio. Symbolic model checking of deontic interpreted systems via OBDD's. In Proceedings of DEON04, Seventh International Workshop on Deontic Logic in Computer Science, volume 3065 of Lecture Notes in Computer Science. Springer Verlag, May 2004.
16. F. Raimondi and A. Lomuscio. Towards model checking for multiagent systems via OBDD's. In Proceedings of the Third NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS III), Lecture Notes in Computer Science. Springer Verlag, April 2004. To appear.
17. F. Raimondi and A. Lomuscio. Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'04), July 2004.
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. M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multi-Agent Systems. IEEE Press, 2000.
22. M. Wooldridge. An introduction to multi-agent systems. John Wiley, England, 2002.
23. 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.