Model checking temporal logics of knowledge in distributed systems

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 98-103

  Su, Kaile ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAM INTERPRETERS;

INTERPRETED SYSTEMS; LINEAR TEMPORAL LOGIC (LTL); MODEL CHECKING; TEMPORAL LOGICS;

LOGIC PROGRAMMING;

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

References (21)

1. Benerecetti, M., and Giunchiglia, F. 2000. Model checking security protocols using a logic of belief. In Graf, S., and Schwartzbach, M., eds., Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), 519-534.
2. 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, volume LNAI Vol. 1555. Berlin: Springer-Verlag.
3. Bryant, R. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers (C-35(8)).
4. Clark, E.; Grumberg, O.; and Peled, D. 2000. Model Checking. Cambridge, MA: The MIT Press.
5. E.M. Clarke, O. G., and Hamaguchi, K. 1994. Another look at LTL model checking. In Proc. 6th Conference on Computer Aided Verification, 415-427. Springer LNCS Vol. 818.
6. Engelhardt, K.; van der Meyden, R.; and Moses, Y. 1998. Knowledge and the logic of local propositions. In Theoretical Aspects of Rationality and Knowledge, Proc. of TARK 1998.
7. Engelhardt, K.; van der Meyden, R.; and Su, K. 2002. Modal logics with a hierarchy of local propositional quantifiers (preliminary version). In Advance in Modal Logic 2002 (AiML), 63-76.
8. Fagin, R.; Halpern, J.; Moses, Y.; and Vardi, M. 1995. Reasoning about knowledge. Cambridge, MA: MIT Press.
9. Halpern, J., and Vardi, M. 1989. The complexity of reasoning about knowledge and time, I: Lower bounds. Journal of Computer and System Sciences 38(1):195-237.
10. Halpern, J., and Vardi, M. 1991. Model checking vs. theorem proving: A manifesto. In Proc. 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning, 325-334.
11. Hoek, W. v. d., and Wooldridge, M. 2002. Model checking knowledge and time. In 9th Workshop on SPIN (Model Checking Software).
12. Holzmann, G. 1997. The spin model checker. IEEE Transaction on Software Engineering 23:279-295.
13. Lichtenstein, O., and Pnueli, A. 1985. Checking that finite-state concurrent programs satisfy their linear apecification. In Proc. 12th ACM Symp. of Prog. Lang., 97-107.
14. Manna, Z., and Pnueli, A. 1995. Temporal Verification of Reactive Systems. Berlin, Germany: Springer-verlag.
15. McMillan, K. 1993. Symbolic Model Checking. Boston: Kluwer Academic Publisher.
16. Pnueli, A. 1977. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundations of Computer Science, 46-57.
17. Rao, A., and Georgeff, M. 1993. A model theoretic approach to the verification of situated reasoning systems. In Proc. 13th International Joint Conference on Artificial Intelligence, 318-324.
18. Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5:285-309.
19. van der Meyden, R., and Su, K. 2004. Symbolic model checking the knowledge of the dining cryptographers. In Proc. of 17th IEEE Computer Security Foundation Workshop.
20. van der Meyden, R. 1998. Common knowledge and update in finite environments. Information and Computation 140(2):115-157.
21. Vardi, M. 2001. Branching vs. linear time:. In Margaria, T., and Yi, W., eds., Proc. 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), 1-22.