Foundations of knowledge for distributed systems
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An axiomatic basis for computer programming
Communications of the ACM
A dynamic logic of multiprocessing with incomplete information
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
The complexity of propositional linear temporal logics
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Knowledge, common knowledge and related puzzles (Extended Summary)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Generalized modal satisfiability
Journal of Computer and System Sciences
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
A propositional logic of distributed protocols is introduced which includes both the logic of knowledge and temporal logic. Phenomena in distributed computing systems such as asynchronous time, incomplete knowledge by the computing agents in the system, and game-like behavior among the computing agents are all modeled in the logic. Two versions of the logic, the linear logic of protocols (LLP) and the tree logic of protocols (TLP) are investigated. The main result is that the set of valid formulas in LLP is undecidable.