Consensus in the presence of partial synchrony
- C. Dwork, N. Lynch, L. Stockmeyer
- Computer Science, MathematicsJACM
- 1 April 1988
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.
Impossibility of distributed consensus with one faulty process
- M. Fischer, N. Lynch, M. Paterson
- MathematicsACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 21 March 1983
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.
Probabilistic Simulations for Probabilistic Processes
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.
Impossibility of distributed consensus with one faulty process
- M. Fischer, N. Lynch, M. Paterson
- MathematicsJACM
- 1 April 1985
In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
- S. Gilbert, N. Lynch
- Computer ScienceSIGA
- 1 June 2002
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.
An introduction to input/output automata
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.
Distributed computation in dynamic networks
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.
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-theoretical…
Hybrid I/O automata
- N. Lynch, R. Segala, F. Vaandrager
- Computer ScienceInformation and Computation
- 22 October 1995
Reaching approximate agreement in the presence of faults
- D. Dolev, N. Lynch, S. Pinter, E. W. Stark, W. Weihl
- Computer ScienceJACM
- 1 May 1986
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…
...
...