On Byzantine generals with alternative plans

DOI10.1016/j.jpdc.2008.04.008zbMath1243.68085OpenAlexW2066682419WikidataQ57603697 ScholiaQ57603697MaRDI QIDQ436889

Alysson Neves Bessani, Paulo Veríssimo, Miguel Correia

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

zbMATH Keywords

fault tolerancedistributed computingconsensusagreementByzantine faults

Mathematics Subject Classification ID

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

Uses Software

• Linda

Cites Work

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

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