Implementing Consensus in Enriched Crash-Prone Asynchronous Systems

  • Michel Raynal


The previous chapter focused on the consensus agreement abstraction. It showed its universality power for implementing objects whose consensus number is greater than 1, and its implementability limit (namely, the impossibility to implement consensus in the basic system model CAMPn,t[t < n/2]).


Asynchronous algorithm Binary consensus Common coin Consensus abstraction Eventual leader (Ω) Fair message scheduling Failure detector Hybrid algorithm Indulgent algorithm Local coin Process crash Random number Unreliable broadcast Zero degradation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Michel Raynal
    • 1
  1. 1.IRISA-ISTIC Université de Rennes 1Institut Universitaire de FranceRennesFrance

Personalised recommendations