Chandra–Toueg consensus algorithm: Difference between revisions

Revision as of 18:57, 14 January 2019

Revision as of 18:59, 14 January 2019

Line 31:

=== Assumptions ===

Recall that the Chandra–Toueg consensus algorithm requires n = 2*f + 1 processes, where at most f of which are faulty (i.e., eventually crash).

=== Proof of correctness ===