Model checking temporal logics of knowledge via OBDDs

Computer Journal

Volumn 50, Issue 4, 2007, Pages 403-420

  Su, Kaile ^a,b   Sattar, Abdul ^b   Luo, Xiangyu ^c  

^a PEKING UNIVERSITY   (China)

^b GRIFFITH UNIVERSITY   (Australia)

^c GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

Distributed AI; Model checking; Reasoning about knowledge; Temporal logics of knowledge; Temporal reasoning

Indexed keywords

DISTRIBUTED ARTIFICIAL INTELLIGENCE; ORDERED BINARY DECISION DIAGRAMS; SYMBOLIC MODEL CHECKING; TEMPORAL REASONING;

BINARY DECISION DIAGRAMS; COMPUTER SIMULATION; CRYPTOGRAPHY; KNOWLEDGE BASED SYSTEMS; MODEL CHECKING; SEMANTICS; TEMPORAL LOGIC;

ARTIFICIAL INTELLIGENCE;

EID: 34447507677     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm009     Document Type: Article

References (30)

1. Su, K. (2004) Model checking temporal logics of knowledge in distributed systems. Proc. Nineteenth National Conf. Artificial Intelligence, Sixteenth Conf. Innovative Applications of Artificial Intelligence, pp. 98-103. AAAI Press / The MIT Press.
2. Holzmann, G. (1997) The SPIN model checker. IEEE Trans. Soft. Eng. 23, 279-295.
3. Vardi, M. (2001) Branching vs. linear time. In Margaria, T. and W. Yi (eds.), Proc. 7th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), 1-22. Springer.
4. McMillan, K. (1993) Symbolic Model Checking. Kluwer Academic Publisher, Boston.
5. Halpern, J. and Vardi, M. (1989) The complexity of reasoning about knowledge and time, I: Lower bounds. J. Comput. Syst. Sci., 38 195-237.
6. Halpern, J. and Vardi, M. Y. (1991) Model checking vs. theorem proving: a manifesto. Technical report. IBM Almaden Research Center. Proc. 2nd Int. Conf. Principles of Knowledge Representation and Reasoning, 1991.
7. vander Meyden, R. (1998) Common knowledge and update in finite environments. Inf. Comput., 140, 115-157.
8. Rao, A. and Georgeff, M. (1993) A model theoretic approach to the verification of situated reasoning systems. Proc. 13th Int. Joint Conf. Artificial Intelligence, pp. 318-324.
9. Benerecetti, M., Giunchiglia, F. and Serafini, L. (1999) A model checking algorithm for multi-agent systems. In Muller, J., Singh, M. and Rao, A. (eds.), Intelligent Agents V. Springer-Verlag, Berlin.
10. Benerecetti, M. and Giunchiglia, F. (2000) Model checking security protocols using a logic of belief. In Graf, S. and Schwartzbach, M. (eds.), Proc. 6th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), pp. 519-534. Springer.
11. vander Meyden, R. and Su, K. (2004) Symbolic model checking the knowledge of the dining cryptographers. Proc. 17th IEEE Computer Security Foundations Workshop (CSFW'04), Washington, DC, USA, P. 280. IEEE Computer Society.
12. vander Hoek, W. and Wooldridge, M. (2002) Model checking knowledge and time. Proc. 9th Int. SPIN Workshop on Model Checking of Software, London, UK, 95-111. Springer-Verlag.
13. Pnueli, A. (1977) The temporal logic of programs. Proc. 18th IEEE Symp. Foundations of Computer Science, pp. 46-57.
14. Engelhardt, K., van der Meyden, R. and Moses, Y. (1998) Knowledge and the logic of local propositions. TARK'98: Proc. 7th Conf. on Theoretical Aspects of Rationality and Knowledge, San Francisco, CA, USA, pp. 29-41. Morgan Kaufmann Publishers Inc.
15. Bryant, R. E. (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35, 677-691.
16. Clarke, E. M., Grumberg, O. and Peled, D. A. (2000) Model Checking The MIT Press, Cambridge, Massachusetts.
17. Engelhardt, K., van der Meyden, R. and Su, K. (2002) Modal logics with a linear hierarchy of local propositional quantifiers. In Balbiani, P., Suzuki, N.-Y., Wolter, F. and Zakharyaschev, M. (eds.), Advances in Modal Logic, pp. 9-30. King's College Publications.
18. Fagin, R., Halpern, J., Moses, Y. and Vardi, M. (1995) Reasoning About Knowledge. MIT Press, Cambridge, MA.
19. Manna, Z. and Pnueli, A. (1995) Temporal Verification of Reactive Systems. Springer-verlag, Berlin, Germany.
20. Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math., 5, 285-309.
21. Lichtenstein, O. and Pnueli, A. (1985) Checking that finite state concurrent programs satisfy their linear specification. POPL '85: Proc. 12th ACM SIGACT-SIGPLAN Symp. Principles of programming languages New York, NY, USA, pp. 97-107. ACM Press.
22. Clarke, E. M., Grumberg, O. and Hamaguchi, K. (1994) Another look at LTL model checking. In Dill, D. L. (ed.), CAV, Vol. 818, Lecture Notes in Computer Science, pp. 415-427. Springer.
23. Cimatti, A. et al. (2002) Nusmv 2: An opensource tool for symbolic model checking. In Brinksma, E. and Larsen, K. G. (eds.), CAV-2002 Vol. 2404, Lecture Notes in Computer Science, pp. 359-364. Springer.
24. Cavada, R. et al. (2002) NuSMV 2.1 User Manual. ITCIRST: Istituto Trentino di Cultura/Istituto Ricerca Scientifica e Tecnologica, Trento, Italy. http://nusmv.irst.itc.it/NuSMV/userman/v21/nusmv.pdf.
25. Chaum, D. (1988) The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptolo., 1, 65-75.
26. Gammie, P. and van der Meyden, R.. (2004) MCK: Model checking the logic of knowledge. In Alur, R. and Peled, D. (eds.), Proc. CAV-2004, Vol. 3114, Lecture Notes in Computer Science, pp. 479-483. Springer.
27. Lomuscio, A. and Raimondi, F. (2006) MCMAS: A model checker for multi-agent systems. In Hermanns, H. and Palsberg, J. (eds.), Proc. TACAS-2006, Vol. 3920, Lecture Notes in Computer Science, pp. 450-454. Springer.
28. Raimondi, F. and Lomuscio, A. (2004) Verification of multiagent systems via ordered binary decision diagrams: An algorithm and its implementation. Proc. AAMAS-2004, pp. 630-637.
29. van Ditmarsch, H. P. (2003) The russian cards problem. Stud. Log., 75, 31-62.
30. van Ditmarsch, H. P. et al. (2006) Model checking russian cards. Electron. Notes Theor. Comput. Sci., 149, 105-123.