Correctness Proof of Ben-Or's Randomized Consensus Algorithm
| dc.contributor.author | Aguilera, Marcos Kawazoe | en_US |
| dc.contributor.author | Toueg, Sam | en_US |
| dc.date.accessioned | 2007-04-23T18:13:01Z | |
| dc.date.available | 2007-04-23T18:13:01Z | |
| dc.date.issued | 1998-05 | en_US |
| dc.description.abstract | We present a correctness proof for Ben-Or's Randomized Consensus Algorithm for the case in which processes can fail by crashing, and a majority of processes is correct. This is the first time that the proof of Ben-Or's algorithm appears for this case. The proof has been extracted from [AT96]: it is a simplification of the correctness proof of a more complex consensus algorithm that involves both randomization and failure detection. | en_US |
| dc.format.extent | 98331 bytes | |
| dc.format.extent | 228968 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1682 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7336 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Correctness Proof of Ben-Or's Randomized Consensus Algorithm | en_US |
| dc.type | technical report | en_US |