On Byzantine generals with alternative plans

DOI10.1016/J.JPDC.2008.04.008zbMATH Open1243.68085OpenAlexW2066682419WikidataQ57603697 ScholiaQ57603697MaRDI QIDQ436889FDOQ436889

Authors: Miguel Correia, Alysson Neves Bessani, Paulo Veríssimo 

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.04.008

Recommendations

• The Weak Byzantine Generals Problem
• scientific article; zbMATH DE number 4058837
• A new solution for the Byzantine generals problem
• A simple Byzantine generals protocol
• On Optimal Probabilistic Asynchronous Byzantine Agreement

zbMATH Keywords

agreementdistributed computingconsensusfault toleranceByzantine faults

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cites Work

• Generative communication in Linda
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Consensus in Byzantine asynchronous systems
• Title not available (Why is that?)
• Byzantine Fault Detectors for Solving Consensus
• Title not available (Why is that?)

Cited In (1)

• Defending the Roman Empire---a new strategy

Uses Software

• Linda

This page was built for publication: On Byzantine generals with alternative plans

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436889)