Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A knowledge-based analysis of zero knowledge
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Concurrent common knowledge: a new definition of agreement for asynchronous systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Knowledge, probability, and adversaries
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
First steps in modal logic
Reasoning about knowledge
Modal logic
Communication and Concurrency
Common Knowledge and Consistent Simultaneous Coordination
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Concurrent common knowledge: defining agreement for asynchronous systems
Distributed Computing
Dynamic Epistemic Logic
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Decidable extensions of hennessy-milner logic
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.