The essence of coin lemmas

Electronic Notes in Theoretical Computer Science

Volumn 22, Issue , 1999, Pages 188-207

  Segala, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; DECISION THEORY; PROBABILITY; PROBLEM SOLVING; SET THEORY;

COIN LEMMAS; DISTRIBUTED ALGORITHMS; PROBABILITY DISTRIBUTION; RANDOMIZED SYSTEMS;

MARKOV PROCESSES;

EID: 18944363895     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80603-6     Document Type: Conference Paper

References (43)

1. S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis.
2. Aspnes J., Herlihy M.P. Fast randomized consensus using shared memory. Journal of Algorithms. 15:(1):September 1990;441-460
3. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. In Cleaveland [9], pages 472-485
4. Baeten J.C.M., Klop J.W. Proceedings of CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. 1990;Springer-Verlag
5. M. Ben-Or. Another advantage of free choice: completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 1983.
6. I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Baeten and Klop [4], pages 126-140.
7. I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Science, Uppsala University, 1990.
8. Cleaveland R., Smolka S.A., Zwarico A. Testing preorders for probabilistic processes (extended abstract). Proceedings 19 ICALP, Madrid, volume 623 of Lecture Notes in Computer Science. 1992;708-719 Springer-Verlag
9. Cleaveland W.R. Proceedings of CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science. 1992;Springer-Verlag
10. Derman C. Finite State Markovian Decision Processes. 1970;Acedemic Press
11. Dolev S., Israeli A., Moran S. Analyzing expected time by scheduler-luck games. IEEE Transactions on Parallel and Distributed Systems. 8:(4):April 1997;424-440
12. Feller W. An Introduction to Probability Theory and its Applications. Volume 1:1950;Jokn Wiley & Sons, Inc
13. Fischer M., Lynch N., Paterson M. Impossibility of distributed consensus with a family of faulty process. Journal of the ACM. 32:(2):April 1985;374-382
14. Giacalone A., Jou C., Smolka S.A. Algebraic reasoning for probabilistic concurrent systems. Proceedings of the Working Conference on Programming Concepts and Methods (IFIP TC2), Sea of Galilee, Israel. 1990
15. van Glabbeek R.J., Smolka S.A., Steffen B., Tofts C.M.N. Reactive, generative, and stratified models of probabilistic processes. In Proceedings 5th Annual Symposium on Logic in Computer Science, Philadelphia, USA. 1990;130-141 IEEE Computer Society Press
16. Hansson H. Time and Probability in Formal Design of Distributed Systems. volume 1 of Real-Time Safety Critical Systems. 1994;Elsevier
17. H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proceedings of the 10th IEEE Symposium on Real-Time Systems, Santa Monica, Ca., 1989.
18. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings of the 11th IEEE Symposium on Real-Time Systems, Orlando, Fl., 1990.
19. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, July 1991.
20. Jonsson B., Yi W. Compositional testing preorders for probabilistic processes. Proceedings 10th Annual Symposium on Logic in Computer Science, San Diego, California. 1995;IEEE Computer Society Press
21. C.C. Jou and S.A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In Baeten and Klop [4], pages 367-383.
22. Keller R. Formal verification of parallel programs. Communications of the ACM. 7:(19):1976;561-572
23. Kushilevitz E., Rabin M. Randomized mutual exclusion algorithms revisited. Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada. 1992;275-284
24. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Conference Record of the 16th ACM Symposium, on Principles of Programming Languages, Austin, Texas. 1989;344-352
25. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94:(l):September 1991;1-28
26. K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Cleaveland [9], pages 456-471.
27. Lehmann D., Rabin M. On the advantage of free choice: a symmetric and fully distributed solution to the dining philosophers problem. Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages. January 1981;133-138
28. Lynch N.A., Saias I., Segala R. Proving time bounds for randomized distributed algorithms. Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA. 1994;314-323
29. Lynch Nanc., Vaandrager Frit. Forward and backward simulations - Part I: Untimed systems. Information and Computation. 121:(2):September 1995;214-233
30. Lynch Nanc., Vaandrager Frit. Forward and backward simulations - Part II: Timing-based systems. Information and Computation. 128:(l):July 1996;1-25
31. Carroll Morgan and Annabelle McIver. A probabilistic temporal calculus based on expectations. In Lindsay Groves and Steve Reeves, editors, Proceedings of Formal Methods Pacific′97. Springer Verlag Singapore, July 1997. http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
32. Pnueli A., Zuck L. Verification of multiprocess probabilistic protocols. Distributed Computing. 1:(1):1986;53-72
33. Pogosyants A., Segala R. Automatic verification of time properties of randomized distributed algorithms. Manuscript in progress. 1995
34. Pogosyants A., Segala R., Lynch N. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Technical Memo MIT/LCS/TM - 555. 1997;MIT Laboratory for Computer Science
35. Rabin M.O. Probabilistic automata. Information and Control. 6:1963;230-245
36. J.R. Rao. Reasoning about probabilistic algorithms. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1990.
37. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995.
38. Also appears as technical report MIT/LCS/TR - 676.
39. C. Tofts. A synchronous calculus of relative frequencies. In Baeten and Klop [4].
40. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pages 327-338, Portland, OR, 1985.
41. Wu S.H., Smolka S., Stark E.W. Composition and behaviors of probabilistic I/O automata. Jonsson B., Parrow J. Proceedings of CONCUR 94, Uppsala Sweden, volume 836 of Lecture Notes in Computer Science. 1994;Springer-Verlag
42. Yi W., Larsen K.G. Testing probabilistic and nondeterministic processes. Protocol Specification, Testing and Verification XII. 1992;47-61
43. L. Zuck. Past Temporal Logic. PhD thesis, The Weizman Institute of Science, 1986.