• Publications
  • Influence
Impossibility of distributed consensus with one faulty process
TLDR
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. Expand
  • 2,876
  • 170
  • PDF
Consensus in the presence of partial synchrony
TLDR
The concept of partial synchrony in a distributed system is introduced. Expand
  • 1,430
  • 154
  • PDF
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
TLDR
We prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model. Expand
  • 1,598
  • 98
  • PDF
Probabilistic Simulations for Probabilistic Processes
TLDR
Probabilistic simulation relations for probabilistic systems are defined and evaluated according to two criteria: compositionality and preservation of "interesting" properties. Expand
  • 801
  • 98
  • PDF
Impossibility of distributed consensus with one faulty process
TLDR
We show that every protocol for the consensus problem has the possibility of nontermination, even with only one faulty process. Expand
  • 1,946
  • 84
  • PDF
An introduction to input/output automata
TLDR
The input output automaton model has recently been de ned in LT LT as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science. Expand
  • 1,300
  • 84
  • PDF
Distributed computation in dynamic networks
TLDR
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. Expand
  • 342
  • 53
  • PDF
Hierarchical correctness proofs for distributed algorithms
TLDR
This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. Expand
  • 940
  • 52
  • PDF
Hybrid I/O Automata
TLDR
We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior, allowing communication among components using both shared variables and shared actions. Expand
  • 555
  • 49
  • PDF
Reaching approximate agreement in the presence of faults
TLDR
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 which approximate, rather than exact, agreement is the desired goal. Expand
  • 463
  • 41
  • PDF