Coalgebraic Epistemic Update Without Change of Model

We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions and thus our models do not involve the "change-of-model" phenomena that arise when using Kripke models. However, we prove that the usual models can be constructed from ours by categorical adjunction. The generality and abstraction of our coalgebraic model turns out to be extremely useful in proving preservation properties of update. In particular, we prove that positive knowledge is preserved and acquired as a result of epistemic update. We also prove common and nested knowledge properties of epistemic updates induced by specific epistemic actions such as public and private announcements, lying, and in particular unsafe actions of security protocols. Our model directly gives rise to a coalgebraic logic with both dynamic and epistemic modalities. We prove a soundness and completeness result for this logic, and illustrate the applicability of the logic by deriving knowledge properties of a simple security protocol.

[1]  Michael Wooldridge,et al.  Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, KI.

[2]  Bart Jacobs,et al.  The temporal logic of coalgebras via Galois algebras , 2002, Mathematical Structures in Computer Science.

[3]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[4]  L. Moss Ann. pure appl. logic: Erratum to “coalgebraic logic” 96 (1999) 277–317 , 1999 .

[5]  Martin Rößiger,et al.  Coalgebras and Modal Logic , 2000, CMCS.

[6]  James Worrell,et al.  On the final sequence of a finitary set functor , 2005, Theor. Comput. Sci..

[7]  Mehrnoosh Sadrzadeh,et al.  Epistemic Actions as Resources , 2007, J. Log. Comput..

[8]  Alexandru Baltag,et al.  A Coalgebraic Semantics for Epistemic Programs , 2003, CMCS.

[9]  Abdullah Uz Tansel Temporal Algebras , 2009, Encyclopedia of Database Systems.

[10]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[11]  Lawrence S. Moss,et al.  Logics for Epistemic Programs , 2004, Synthese.

[12]  Corina Cîrstea,et al.  A compositional approach to defining logics for coalgebras , 2004, Theor. Comput. Sci..

[13]  M. Sadrzadeh Actions and resources in epistemic logic , 2006 .

[14]  Corina Cîrstea On Expressivity and Compositionality in Logics for Coalgebras , 2003, CMCS.

[15]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.

[16]  Michael Wooldridge,et al.  Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, COORDINATION.

[17]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[18]  Corina Cîrstea,et al.  Relating Algebraic and Coalgebraic Logics of Knowledge and Update , 2006 .

[19]  J. Gerbrandy Bisimulations on Planet Kripke , 1999 .

[20]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[21]  A. Joyal,et al.  An extension of the Galois theory of Grothendieck , 1984 .

[22]  Mehrnoosh Sadrzadeh,et al.  Algebra and Sequent Calculus for Epistemic Actions , 2005, LCMAS.

[23]  Johan van Benthem,et al.  The Tree of Knowledge in Action: Towards a Common Perspective , 2006, Advances in Modal Logic.

[24]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[25]  Jan A. Plaza,et al.  Logics of public communications , 2007, Synthese.

[26]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

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