Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model

MaRDI QIDQ7361447FDO

Authors Henri Debrat, Stephan Merz

Publication date 27 July 2012

Cites work

• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• Unnamed Publication
• Impossibility of distributed consensus with one faulty process
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• The Heard-Of model: computing in distributed systems with benign faults
• Tolerating corrupted communication

Cited in

(1)

• Consensus Refined

This page was built for software: Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model