Skip Navigation


The Computer Journal Advance Access originally published online on May 15, 2007
The Computer Journal 2007 50(4):403-420; doi:10.1093/comjnl/bxm009
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
50/4/403    most recent
bxm009v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Su, K.
Right arrow Articles by Luo, X.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Model Checking Temporal Logics of Knowledge Via OBDDs1

Kaile Su2,3, Abdul Sattar3 and Xiangyu Luo4,*

2 School of Electronics Engineering and Computer Science, Peking University, Beijing, China
3 Institute for Integrated and Intelligent Systems, Griffith University, Brisbane, Qld 4111, Australia
4 Department of Computer Science, Guilin University of Electronic Technology, Guilin 541004, P.R. China

* Corresponding author: luo.xiangyu{at}yahoo.com

Received 14 June 2006; revised 4 December 2006

Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logics. Comparatively little attention has been given to temporal logics of knowledge, although such logics have been proven to be very useful in the specifications of protocols for distributed systems. In this paper, we addressed the model checking problem for a temporal logic of knowledge (Halpern and Vardi's logic of CKLn). Based on the semantics of interpreted systems with local propositions, we developed an approach to symbolic CKLn model checking via Ordered Binary decision diagrams and implemented the corresponding symbolic model checker MCTK. In our approach to model checking specifications involving agents' knowledge, the knowledge modalities are eliminated via quantifiers over agents' non-observable variables. We then modelled the Dining Cryptographers protocol and the five-hands protocol for Russian Cards problem in MCTK. Via these two examples, we compare MCTK's empirical performance with two different state-of-the-art epistemic model checkers, MCK and MCMAS.

Key Words: model checking • temporal reasoning • reasoning about knowledge • temporal logics of knowledge • distributed AI

1 An earlier version of this paper appeared in Proceedings of AAAI 2004 [1].


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.