Consensus in Byzantine asynchronous systems

DOI10.1016/S1570-8667(03)00025-XzbMath1074.68002MaRDI QIDQ1827288

Lenaik Tangui, Roberto Baldoni, Michel Raynal, Jean-Michel Helary

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

Asynchronous systemsFault-toleranceFailure detectorsByzantine failuresConsensus problem

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (2)

Consensus in the presence of mortal Byzantine faulty processes ⋮ On Byzantine generals with alternative plans

Cites Work

• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Early consensus in an asynchronous system with a weak failure detector
• Unnamed Item

This page was built for publication: Consensus in Byzantine asynchronous systems