Combining Epistemic Logic and Hennessy-Milner Logic

We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic but is a direct combination of Hennessy-Milner logic and epistemic logic. We give an axiomatization for the logic and prove a completeness theorem with respect to the class of models obtained by unfolding labelled transition systems.

[1]  Joseph Y. Halpern,et al.  Knowledge, probability, and adversaries , 1993, JACM.

[2]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[3]  Corrado Priami,et al.  A Decidable Extension of Hennessy-Milner Logic with Spatial Operators , 2006 .

[4]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[5]  Corrado Priami,et al.  Decidable Extensions of Hennessy-Milner Logic , 2006, FORTE.

[6]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[7]  ERIC PACUIT,et al.  REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION , 2011, The Review of Symbolic Logic.

[8]  Gil Neiger,et al.  Common knowledge and consistent simultaneous coordination , 1991, Distributed Computing.

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  Simona Orzan,et al.  Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap , 2007, LPAR.

[11]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[12]  Rohit Chadha,et al.  Epistemic Logic for the Applied Pi Calculus , 2009, FMOODS/FORTE.

[13]  N. Malcolm On Knowledge and Belief , 1954 .

[14]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[15]  Prakash Panangaden,et al.  Epistemic Strategies and Games on Concurrent Processes , 2009, TOCL.

[16]  David Lee,et al.  Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings , 2009, FMOODS/FORTE.

[17]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[18]  C. Guarneri Cornell University Press , 1991 .

[19]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[20]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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

[22]  Wiebe van der Hoek,et al.  First steps in modal logic , 1997 .

[23]  Prakash Panangaden,et al.  Concurrent common knowledge: defining agreement for asynchronous systems , 2005, Distributed Computing.

[24]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[25]  Prakash Panangaden,et al.  Concurrent common knowledge: a new definition of agreement for asynchronous systems , 1988, PODC '88.

[26]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[27]  Gil Neiger,et al.  Substituting for real time and common knowledge in asynchronous distributed systems , 1987, PODC '87.

[28]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[29]  Joseph Y. Halpern,et al.  A knowledge-based analysis of zero knowledge , 1988, STOC '88.

[30]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .