Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Computing
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Logics of time and computation
Logics of time and computation
Simulating synchronous processors
Information and Computation
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
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols
IEEE Transactions on Computers
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
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
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Knowledge Consistency: A Useful Suspension of Disbelief
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge, common knowledge and related puzzles (Extended Summary)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study a formal method for comparing distributed systems with respect to their abilities to solve various problems. To this end, we introduce a knowledge-based propositional modal language for axiomatically characterizing distributed systems and problems. Given a specification in the language, we show how to build a Kripke model so that a formula is true in the model exactly when it is provable using the axioms which specify the system. The models help us to formalize the description of the global observer's view of a system and show the effects of the global view on our ability to compare systems. An example shows that two distributed systems, running different protocols, are identical when the global view is restricted to a particular set of formulas, extracted from a problem specification. Under the unrestricted view, however, these systems appear quite different. We can generalize our comparisons by using a particular type of graph reduction between models to establish a relationship between seemingly dissimilar systems.