Consensus in the presence of mortal Byzantine faulty processes
From MaRDI portal
Publication:424903
DOI10.1007/s00446-011-0147-3zbMath1255.68043OpenAlexW2167979110MaRDI QIDQ424903
Josef Widder, Günther Gridling, Martin Biely, Bettina Weiss, Jean-Paul Blanquart
Publication date: 7 June 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0147-3
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
Active fault tolerant control systems by the semi‐Markov model approach, Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
Cites Work
- Unnamed Item
- Unnamed Item
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Bounded cost algorithms for multivalued consensus using binary consensus instances
- Decomposition of distributed programs into communication-closed layers
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- In search of lost time
- Consensus in Byzantine asynchronous systems
- Low complexity Byzantine-resilient consensus
- From partial consistency to global broadcast
- Early stopping in Byzantine agreement
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
- Distributed agreement in the presence of processor and communication faults
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Byzantine Fault Detectors for Solving Consensus
- New hybrid fault models for asynchronous approximate agreement
- Uniform consensus is harder than consensus
- Fast fault-tolerant agreement algorithms
