The possibility of partial failure occuring at any stage of computation complicates rigorous formal treatment of distributed algorithms. We propose a methodology for formalising and proving the correctness of distributed algorithms which alleviates this complexity. The methodology uses fault-tolerance bisimulation proof techniques to split the analysis into two phases, that is a failurefree phase and a failure phase, permitting separation of concerns. We design a minimal partial-failure calculus, develop a corresponding bisimulation theory for it and express a consensus algorithm in the calculus. We then use the consensus example and the calculus theory to demonstrate the benefits of our methodology. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Francalanza, A., & Hennessy, M. (2007). A fault tolerance bisimulation proof for consensus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4421 LNCS, pp. 395–410). Springer Verlag. https://doi.org/10.1007/978-3-540-71316-6_27
Mendeley helps you to discover research relevant for your work.