Distributed consensus, revisited

被引：8

作者：

Fuzzati, Rachele

Merro, Massimo ^{[1
]}

Nestmann, Uwe

机构：

[1] Univ Verona, Dept Comp Sci, I-37100 Verona, Italy

[2] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland

[3] Tech Univ Berlin, Berlin, Germany

来源：

ACTA INFORMATICA | 2007年 / 44卷 / 06期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1007/s00236-007-0052-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors ((sic)S or, equivalently,Omega), under the hypothesis that only a minority of processes may crash. The model is defined as a global transition system that is unambigously generated by local transition rules. The model is syntax-free in that it does not refer to any form of programming language or pseudo code. We use our model to formally prove that the algorithm is correct.

引用

页码：377 / 425

页数：49

共 26 条

[1] THE EXISTENCE OF REFINEMENT MAPPINGS [J].