Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study*
Name
MIT-LCS-TM-555.pdf
Size
7.11 MB
Format
Adobe PDF
Checksum (MD5)
5142d086a4d81cc6c7b713013f9ee3aa
Author(s)
Pogosyants, Anna
Segala, Roberto
Lynch, Nancy A.
Date Issued
June 1997
Series/Report no.
MIT-LCS-TM-555
Abstract
The Probabilistic I/O Automaton model of [20] is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The algorithm guarantees termination within expected polynomial time. The Aspnes-Herlihy algorithm is a rather complex algorithm. Processes move through a succesion of asynchronous rounds, attempting to agree at each round. At each round, the agreement attempt involves a distributed random walk.
Persistent DSpace Link
