Modeling the epistemics of communication with functional programming

Dynamic epistemic logic is the logic of the effects of epistemic actions like making public announcements, passing private messages, revealing secrets, telling lies. This paper takes its starting point from the version of dynamic epistemic logic of [4], and demonstrates a tool that can be used for showing what goes on during a series of epistemic updates: the dynamic epistemic modeling tool DEMO [10]. DEMO allows modeling epistemic updates, graphical display of update results, graphical display of action models, formula evaluation in epistemic models, and translation of dynamic epistemic formulas to PDL [22] formulas. DEMO is written in Haskell. This paper intends to demonstrate its usefulness for visualizing the model transformations that take place during epistemic updating.

[1]  Steve A. Schneider,et al.  CSP and Anonymity , 1996, ESORICS.

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

[3]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[4]  A. W. Roscoe.  Modelling and verifying key-exchange protocols using CSP and FDR , 1995, Proceedings The Eighth IEEE Computer Security Foundations Workshop.

[5]  Olivier Pereira,et al.  Modelling and Security Analysis of Authenticated Group Key Agreement Protocols , 2003 .

[6]  Hans van Ditmarsch,et al.  The Russian Cards Problem , 2003, Stud Logica.

[7]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

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

[9]  Jan van Eijck,et al.  Logics of communication and change , 2006, Inf. Comput..

[10]  Erik P. de Vink,et al.  Update Semantics of Security Protocols , 2004, Synthese.

[11]  Vaughan R. Pratt,et al.  Application of modal logic to programming , 1980 .

[12]  Emden R. Gansner,et al.  Drawing graphs with dot , 2006 .

[13]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

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

[15]  Jan van Eijck,et al.  Dynamic epistemic modelling , 2004 .

[16]  Rineke Verbrugge,et al.  Model Checking Sum and Product , 2005, Australian Conference on Artificial Intelligence.

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

[18]  P. T. Geach,et al.  KNOWLEDGE AND BELIEF: An Introduction to the Logic of the Two Notions , 1963 .

[19]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[20]  Jan van Eijck,et al.  Reducing Dynamic Epistemic Logic to PDL by Program Transformation , 2004 .

[21]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

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

[23]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[24]  Alexandru Baltag.  Logics for insecure communication , 2001 .

[25]  Wiebe van der Hoek,et al.  Model Checking Russian Cards , 2006, Electron. Notes Theor. Comput. Sci..

[26]  Erik P. de Vink,et al.  Update Semantics of Security Protocols , 2004 .