Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study

Distributed Computing

Volumn 13, Issue 3, 2000, Pages 155-186

  Pogosyants, Anna ^a   Segala, Roberto ^b   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; PROBABILISTIC LOGICS;

ASPNES-HERLIHY ALGORITHM;

RANDOM PROCESSES;

EID: 0034224327     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008917     Document Type: Article

References (32)

1. K. Abrahamson: On achieving consensus using a shared memory. In: Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, 1988
2. S. Aggarwal: Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis.
3. S. Aggarwal, S. Kutten: Time optimal self stabilizing spanning tree algorithms. In: R.K. Shyamasundar (ed) 13th International Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol 761, p 400-410, Bombay, India., December 1993. Springer Berlin Heidelberg New York
4. J. Aspnes: Time- and space-efficient randomized consensus. J Algorithms, 14(3): 414-431 (1993)
5. J. Aspnes, M.P. Herlihy: Fast randomized consensus using shared memory. J Algorithms, 15(1): 441-460 (1990)
6. 2 n) operations per processor. SIAM J Comput, 25(5): 1024-1044 (1996)
7. H. Attiya, D. Dolev, N. Shavit: Bounded polynomial randomised consensus. In: P. Rudnicki (ed) Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, p 281-294, Edmonton, AB, Canada, August 1989. ACM Press
8. th Annual ACM Symposium on Principles of Distributed Computing, p 209-218, 1997
9. th ICALP, Paderborn, Germany, Lecture Notes in Computer Science, Vol 1099, p 622-633. Springer Berlin Heidelberg New York, 1996
10. A. Bianco, L. de Alfaro: Model checking of probabilistic and nondeterministic systems. In: Proceedings Conferenco on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol 1026, p 499-513, Springer Berlin Heidelberg New York, 1995
11. 2 log n) operations. In: Proceedings of the Fifth Workshop on Distributed Algorithms, 1991
12. T. Chandra: Polylog randomized wait-free consensus. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, p 166-175, 1996
13. C. Derman: Finite State Markovian Decision Processes. Academic Press 1970
14. S. Dolev, A. Israeli, S. Moran: Analyzing expected time by scheduler-luck games. IEEE Trans Software Eng, 21(5): 429-439 (1995)
15. C. Dwork, M. Herlihy, S. Plotkin, O. Waarts: Time-lapse snapshots. In: Proceedings of Israel Symposium on the Theory of Computing Systems, 1992
16. W. Feller: An Introduction to Probability Theory and its Applications. Vol 1. New York: Wiley 1950
17. M. Fischer, N. Lynch, M. Paterson: Impossibility of distributed consensus with a family of faulty process. Journal of the ACM, 32(2): 374-382 (1985)
18. R. Gawlick, R. Segala, J.F. Søgaard-Andersen, N.A. Lynch: Liveness in timed and untimed systems. Technical Report MIT/LCS/TR-587, MIT Laboratory for Computer Science, November 1993
19. H. Hansson: Time and Probability in Formal Design of Distributed Systems, Real-Time Safety Critical Systems, Vol 1. Amsterdam: Elsevier 1994
20. S. Hart, M. Sharir, A. Pnueli: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3): 356-380 (1983)
21. L. Lamport: Concurrent reading and writing. Communications of the ACM, 20(11): 806-811 (1977)
22. D. Lehmann, M. Rabin: On the advantage of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In: Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, p 133-138, January 1981
23. N.A. Lynch: Distributed Algorithms. Morgan Kaufmann 1996
24. N.A. Lynch, I. Saias, R. Segala: Proving time bounds for randomized distributed algorithms. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, p 314-323, 1994
25. N.A. Lynch, M.R. Tuttle: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, p 137-151, Vancouver, Canada, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387
26. N.A. Lynch, F.W. Vaandrager: Forward and backward simulations - part I: Untimed systems. Inf Comput 121(2): 214-233 (1995)
27. C. Morgan, A. McIver, K. Seidel: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3): 325-353 (1996)
28. A. Pnueli, L. Zuck: Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1): 53-72 (1986)
29. A. Pogosyants, R. Segala: Formal verification of timed properties of randomized distributed algorithms. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, p 174-183, August 1995
30. M.O. Rabin: Probabilistic automata. Inform Contr, 6: 230-245 (1963)
31. R. Segala: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995. Also appears as technical report MIT/LCS/TR-676
32. M.Y. Vardi: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of 26th IEEE Symposium on Foundations of Computer Science, p 327-338, Portland, OR, 1985