Distributed Computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Knowledge, timed precedence and clocks (preliminary report)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Reasoning About Knowledge
Knowledge and the ordering of events in distributed systems: extended abstract
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Known unknowns: time bounds and knowledge of ignorance
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Knowledge as a window into distributed coordination
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Common Knowledge in Email Exchanges
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Lamport's Happened-before relation is fundamental to coordinating actions in asynchronous systems. Its role is less dominant in synchronous systems, in which bounds are available on transmission times over channels. This paper initiates a study of the role that time bounds play in synchronous systems by focusing on two classes of problems: Ordered Response, in which a triggering event must be followed by a sequence of events ("responses") performed in a prescribed temporal order, and Simultaneous Response, in which the responses must be performed simultaneously. In both cases, information about the triggering event must flow from its site of origin to the responding sites, and the responses must be timed as specified. A generalization of happened- before called Syncausality, is defined. A pattern of communication consisting of a syncausal chain coupled with an appropriate set of time bound guarantees gives rise to a communication structure called a centipede. Centipedes are a nontrivial generalization of message chains, and their existence is shown to be necessary in every execution of every protocol that solves ordered response. A variation on centipedes called centibrooms are shown to play an analogous role for Simultaneous Response: Every execution of a protocol for Simultaneous Response must contain a centibroom.