Modeling Consensus in a Process Calculus

We give a process calculus model that formalizes a well known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (Diamond S); we use our model to formally prove that the algorithm satisfies its specification.


Published in:
CONCUR 2003 - Concurrency Theory, 399-414
Presented at:
CONCUR 2003, Marseille, France, 3-5 September 2003
Year:
2003
Keywords:
Laboratories:




 Record created 2005-11-23, last modified 2018-10-07

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)