The correctness proof of Ben-Or’s randomized consensus algorithm
| العنوان: | The correctness proof of Ben-Or’s randomized consensus algorithm |
|---|---|
| المؤلفون: | Marcos K. Aguilera, Sam Toueg |
| المصدر: | Distributed Computing. 25:371-381 |
| بيانات النشر: | Springer Science and Business Media LLC, 2012. |
| سنة النشر: | 2012 |
| مصطلحات موضوعية: | Consensus algorithm, Correctness, Theoretical computer science, Computer Networks and Communications, Computer science, Proof complexity, Correctness proofs, Theoretical Computer Science, Computer-assisted proof, Computational Theory and Mathematics, Consensus, Hardware and Architecture, Theory of computation, Computer communication networks |
| الوصف: | 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. |
| تدمد: | 1432-0452 0178-2770 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::1d6dce77913dc6520ddebd9fe88a2044 https://doi.org/10.1007/s00446-012-0162-z |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi...........1d6dce77913dc6520ddebd9fe88a2044 |
| قاعدة البيانات: | OpenAIRE |
Find this article in full text from Springer Verlag. | تدمد: | 14320452 01782770 |
|---|