Common Knowledge and Update in Finite Environments

Abstract Logics of knowledge have been shown to provide a useful approach to the high level specification and analysis of distributed systems. It has been proposed that such systems can be developed using knowledge- based protocols, in which agents' actions have preconditions that test their state of knowledge. Both computer-assisted analysis of the knowledge properties of systems and automated compilation of knowledge-based protocols require the development of algorithms for the computation of states of knowledge. This paper studies one of the computational problems of interest, the model checking problem for knowledge formulae in the S5nKripke structures generated by finite state environments in which states determine an observation for each agent. Agents are assumed to have perfect recall and may operate synchronously or asynchronously. It is shown that, in this setting, model checking of common knowledge formulae is intractable, but efficient incremental algorithms are developed for formulae containing only knowledge operators. Connections to knowledge updates and compilation of knowledge-based protocols are discussed.

[1]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[2]  Ronald Fagin,et al.  Knowledge-based programs , 1995, PODC '95.

[3]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[4]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[5]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[6]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[7]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[8]  Joseph Y. Halpern,et al.  Reasoning about knowledge and time in asynchronous systems , 1988, STOC '88.

[9]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[10]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[11]  John H. Reif,et al.  A dynamic logic of multiprocessing with incomplete information , 1980, POPL '80.

[12]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[13]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[14]  Neil Immerman,et al.  Foundations of Knowledge for Distributed Systems , 1986, TARK.

[15]  Erich Grädel,et al.  Domino Games and Complexity , 1990, SIAM J. Comput..

[16]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[17]  Ron van der Meyden,et al.  Constructing Finite State Implementations of Knowledge-Based Programs with Perfect Recall , 1996, PRICAI Workshop on Intelligent Agent Systems.

[18]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[19]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[20]  Joseph Y. Halpern,et al.  A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.

[21]  Moshe Y. Vardi.  Implementing Knowledge-Based Programs , 1996, TARK.

[22]  Yoram Moses,et al.  Knowledge-oriented programming , 1993, PODC '93.

[23]  Ronald Fagin,et al.  A model-theoretic analysis of knowledge , 1991, JACM.

[24]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[25]  Ron van der Meyden,et al.  Finite State Implementations of Knowledge-Based Programs , 1996, FSTTCS.

[26]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[27]  Richard E. Ladner,et al.  The Logic of Distributed Protocols , 1986, TARK.

[28]  Murray S. Mazer,et al.  A Knowledge Theoretic Account of Recovery in Distributed Systems: The Case of Negotiated Commitment , 1988, TARK.

[29]  Leslie Pack Kaelbling,et al.  The Synthesis of Digital Machines With Provable Epistemic Properties , 1986, TARK.

[30]  Ron van der Meyden,et al.  Axioms for Knowledge and Time in Distributed Systems with Perfect Recall , 1994, LICS.

[31]  Yoav Shoham,et al.  A Mechanism for Reasoning about Time and Belief , 1992, FGCS.

[32]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[33]  Ron van der Meyden,et al.  Knowledge Based Programs: On the Complexity of Perfect Recall in Finite Environments , 1996, TARK.

[34]  Joseph Y. Halpern.  USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[35]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[36]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

[37]  Yoav Shoham.  Agent-Oriented Programming , 1993, Artif. Intell..

[38]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[39]  K. Mani Chandy,et al.  How processes learn , 1985, PODC '85.

[40]  Vassos Hadzilacos,et al.  A knowledge-theoretic analysis of atomic commitment protocols , 1987, PODS '87.