Correctness Proof of Ben-Or's Randomized Consensus Algorithm

dc.contributor.authorAguilera, Marcos Kawazoeen_US
dc.contributor.authorToueg, Samen_US
dc.date.accessioned2007-04-23T18:13:01Z
dc.date.available2007-04-23T18:13:01Z
dc.date.issued1998-05en_US
dc.description.abstractWe 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.extent98331 bytes
dc.format.extent228968 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1682en_US
dc.identifier.urihttps://hdl.handle.net/1813/7336
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleCorrectness Proof of Ben-Or's Randomized Consensus Algorithmen_US
dc.typetechnical reporten_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
98-1682.pdf
Size:
96.03 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
98-1682.ps
Size:
223.6 KB
Format:
Postscript Files