论文信息 - Easy impossibility proofs for distributed consensus problems - 字舞流文

Easy impossibility proofs for distributed consensus problems

Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs.

Nancy A. Lynch | Michael J. Fischer | Michael Merritt

[1] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.

[2] Fred B. Schneider,et al. Inexact agreement: accuracy, precision, and graceful degradation , 1985, PODC '85.

[3] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.

[4] Danny Dolev,et al. On the Possibility and Impossibility of Achieving Clock Synchronization , 1986, J. Comput. Syst. Sci..

[5] Brian A. Coan,et al. The distributed firing squad problem , 1985, STOC '85.

[6] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.

[7] Nancy A. Lynch,et al. Reaching approximate agreement in the presence of faults , 1986, JACM.

[8] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.

[9] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[10] Nancy A. Lynch,et al. The Byzantine Firing Squad Problem. , 1985 .