The Weak Byzantine Generals Problem

@article{Lamport1983TheWB,
  title={The Weak Byzantine Generals Problem},
  author={L. Lamport},
  journal={J. ACM},
  year={1983},
  volume={30},
  pages={668-676}
}
The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an "incorrect" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad. Unlike the onginal problem, an approximate… Expand
161 Citations
The Byzantine Generals Strike Again
  • D. Dolev
  • Mathematics, Computer Science
  • J. Algorithms
  • 1982
  • 521
  • PDF
Byzantine Generals and Transaction Commit Protocols
  • 18
  • PDF
The Failure Discovery problem
  • 5
Agreement under Faulty Interfaces
  • 18
Degradable Byzantine agreement
  • 6
  • Highly Influenced
  • PDF
Easy impossibility proofs for distributed consensus problems
  • 211
  • Highly Influenced
  • PDF
The Distributed Firing Squad Problem (Preliminary Version)
  • 2
  • Highly Influenced
Connectivity requirements for Byzantine agreement under restricted types of failures
  • 12
...
1
2
3
4
5
...