• Publications
  • Influence
Consensus in the presence of partial synchrony
TLDR
Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time. Expand
Impossibility of distributed consensus with one faulty process
TLDR
In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. Expand
Probabilistic Simulations for Probabilistic Processes
TLDR
The interesting properties of a system are identified with those that are expressible in an untimed version of the Timed Probabilistic concurrent Computation Tree Logic (TPCTL) of Hansson. Expand
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
TLDR
This conjecture is proved in the asynchronous network model that it is impossible to achieve all three properties of a distributed web service: consistency, availability, and partition tolerance. Expand
Impossibility of distributed consensus with one faulty process
TLDR
It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem. Expand
An introduction to input/output automata
TLDR
This paper is intended to introduce researchers to the input output automaton model and examines several illustrative examples concerning candy vending machines and other uses of the model. Expand
Distributed computation in dynamic networks
TLDR
A worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current round are before they broadcast their messages is considered. Expand
Hybrid I/O Automata
TLDR
A new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior and allows communication among components using both shared variables and shared actions is proposed. Expand
Hierarchical correctness proofs for distributed algorithms
This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple, powerful model captures in a novel way the game-theoreticalExpand
Reaching approximate agreement in the presence of faults
This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Boolean values or values from some bounded range, and in whichExpand
...
1
2
3
4
5
...