Verification of the randomized consensus algorithm of aspnes and herlihy: A case study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1320, Issue , 1997, Pages 22-36

  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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY MEASURES; COMPUTATIONAL SETTINGS; CONSENSUS ALGORITHMS; EXPECTED COMPLEXITY; FORMAL PRESENTATION; PROBABILISTIC I/O AUTOMATONS; PROBABILISTIC PROPERTIES; RANDOM-WALK THEORY;

POLYNOMIAL APPROXIMATION;

EID: 84949232730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030673     Document Type: Conference Paper

References (11)

1. S. Aggarwal. Time optimal self-stabilizing sparming tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis.
2. S. Aggarwal and S. Kutten. Time optimal self stabilizing sparming tree algorithms. In R.K. Shyamasundar, editor, 13th International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 761 of Lecture Notes in Computer Science, pages 400-410, Bombay, India., December 1993. Springer-Verlag.
3. J. Aspnes and M.P. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 15(1):441-460, September 1990.
4. W. Feller. An Introduction to Probability Theory and its Applications. Volume 1. Jokn Wiley & Sons, Inc, 1950.
5. D. Lehmann and M. Rabin. On the advantage of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8 th Annual ACM Symposium on Principles of Programming Languages, pages 133-138, January 1981.
6. N.A. Lynch, L Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13 tn Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, pages 314-323, 1994.
7. Nancy Lynch and Frits Vaandrager. Forward and backward simulations - Part II: Timing-based systems. Information and Computation, 121(2):214-233, September 1995.
8. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
9. A. Pogesyants and R. Segala. Formal verification of timed properties of randomised distributed algorithms. In Proceedings of the 14 ta Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, pages 174-183, August 1995.
10. A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and HerlLhy: a case study. Technical Memo MIT/LCS/TM-555, MIT Laboratory for Computer Science, 1997.
11. 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.