Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analyze the expected complexity of the algorithm. Key words: Randomized consensus

• Type: Journal
• Year: 2000
• Where: DC
• Authors: Anna Pogosyants, Roberto Segala, Nancy A. Lynch
• Keywords: Abstraction Mappings, DC 2000, DC 2001, Probabilistic Properties, Random Walk Theory