MCK: Model Checking the Logic of Knowledge

  • Peter Gammie
  • Ron van der Meyden
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3114)


The specification formalism employed in model checking is usually some flavour of temporal or process algebraic language that expresses properties of the behavioural aspects of a system. Knowledge [5] is a modality that is orthogonal to the behavioural dimension, capturing properties of information flow. Logics of knowledge have been shown to be a useful framework for the analysis of distributed algorithms and security protocols, and model checking of these logics was first mooted by Halpern and Vardi [6]. Since that time theoretical aspects of model checking the logic of knowledge and its combinations with temporal logic have been studied [8–10]. The system MCK introduced in this paper implements parts of this theory.


Model Check Linear Time Temporal Logic Perfect Recall Branch Time Logic Temporal Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Benerecetti, M., Giunchiglia, F., Serafini, L.: Multiagent model checking. Journal of Logic and Computation 8(3), 401–423 (1997)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bertoli, P., Cimatti, A., Pistore, M., Taverso, P.: Plan validation for extended goals under partial observability (preliminary report). In: AIPS 2002 Workshop on Planning via Model Checking, Toulouse, France (April 2002)Google Scholar
  3. 3.
    Engelhardt, K., van der Meyden, R., Moses, Y.: Knowledge and the logic of local propositions. In: Gilboa, I. (ed.) Theoretical Aspects of Rationality and Knowledge, July 1998, pp. 29–41. Morgan Kaufmann, San Francisco (1998)Google Scholar
  4. 4.
    Bordini, R.H., Fisher, M., Pardavila, C., Visser, W., Wooldridge, M.: Model checking multi-agent programs with CASP. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 110–113. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Halpern, J., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Halpern, J., Vardi, M.Y.: Model checking vs. theorem proving: A manifesto. Technical Report RJ 7963, IBM Almaden Research Center (1991)Google Scholar
  7. 7.
    van der Hoek, W., Wooldridge, M.: Model checking knowledge and time. In: 9th Workshop on SPIN (Model Checking Software), Grenoble (April 2002)Google Scholar
  8. 8.
    van der Meyden, R.: Common knowledge and update in finite environments. Information and Computation 140(2) (1998)Google Scholar
  9. 9.
    van der Meyden, R., Shilov, N.S.: Model checking knowledge and time in systems with perfect recall. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 262–273. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers. In: IEEE Computer Security Foundations Workshop (2004)Google Scholar
  11. 11.
    Shilov, N.Y., Garanina, N.O.: Model checking knowledge and fixpoints. In: FLOC workshop on Fixed Points in Computer Science (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Peter Gammie
    • 1
  • Ron van der Meyden
    • 2
  1. 1.Computing ScienceChalmers Institute of TechnologySweden
  2. 2.School of Computer Science and EngineeringUniversity of New South Wales, and National ICT AustraliaSydneyAustralia

Personalised recommendations