Analysing randomized distributed algorithms

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

Volumn 2925, Issue , 2004, Pages 384-418

  Norman, Gethin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BASED REASONINGS; CACHE MANAGEMENT; DISTRIBUTED COMPUTATIONS; DISTRIBUTED COMPUTER NETWORKS; PROBABILISTIC ANALYSIS; PROBABILITY SPACES; RANDOMIZED ALGORITHMS; RANDOMIZED DISTRIBUTED ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646409166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_11     Document Type: Article

References (107)

1. S. Aggarwal and S. Kutten. Time-optimal self stabilizing spanning tree algorithms. In R. Shyamasundar, editor, Proc. Foundations of Software Technology and Theoretical Computer Science, volume 761 of LNCS, pages 15-17. Springer, 1993.
2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems. In J. Albert, B. Monien, and M. Rodrf́8guez-Artalejo, editors, Proc. Int. Col. Automata, Languages and Programming (ICALP'91), volume 510 of LNCS, pages 115-136. Springer, 1991.
3. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
4. R. Alur and T. Henzinger. Reactive modules. Formal Methods in System Design, 15:7-48, 1999.
5. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-460, 1990.
6. C. Baier, M. Huth, M. Kwiatkowska, and M. Ryan, editors. Proc. Int. Workshop Probabilistic Methods in Verification (PROBMIV'98), volume 22 of ENTCS. Elsevier Science, 1998.
7. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125-155, 1998.
8. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proc. Symp. Principles of Distributed Computing (PODC'83), pages 27-30. ACM Press, 1983.
9. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. Thiagarajan, editor, Proc. Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer, 1995.
10. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols (extended abstract). In J. Kilian, editor, Proc. Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 524-541. Springer, 2001.
11. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography (extended abstract). In Proc. Symp. Principles of Distributed Computing (PODC'00), pages 123-132. ACM Press, 2000.
12. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
13. R. Cleaveland, S. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. In W. Kuich, editor, Proc. Int. Col. Automata, Languages and Programming (ICALP'92), volume 623 of LNCS, pages 708-719. Springer, 1992.
14. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
15. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Symp. Principles of Programming Languages (POPL'77), pages 238-252. ACM Press, 1977.
16. S. Creese and A. Roscoe. Data independent induction over structured networks. In H. Arabnia, editor, Proc. Int. Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA'00), volume II. CSREA Press, 2000.
17. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In de Alfaro and Gilmore [24], pages 39-56.
18. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reduction and refinement strategies for probabilistic anylsis. In Hermanns and Segala [42], pages 57-76.
19. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In Proc. Int. Workshop Formal Methods for Industrial Critical Systems (FMICS'02), volume 66(2) of ENTCS. Elsevier Science, 2002.
20. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
21. L. de Alfaro. Temporal logics for the specification of performance and reliability. In R. Reischuk and M. Morvan, editors, Proc. Symp. Theoretical Aspects of Computer Science (STACS'97), volume 1200 of LNCS, pages 165-176. Springer, 1997.
22. L. de Alfaro. From fairness to chance. In Baier et al. [6].
23. L. de Alfaro. How to specify and verify the long-run average behaviour of probabilistic systems. In Proc. Symp. Logic in Computer Science (LICS'98), pages 454-465. IEEE Computer Society Press, 1998.
24. L. de Alfaro and S. Gilmore, editors. Proc. Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01), volume 2165 of LNCS. Springer, 2001.
25. L. de Alfaro, T. Henzinger, and R. Jhala. Compositional methods for probabilistic systems. In Larsen and Nielsen [60], pages 351-365.
26. C. Derman. Finite-State Markovian Decision Processes. New York: Academic Press, 1970.
27. E. Dijkstra. A Discipine of Programming. Prenticec Hall International, 1976.
28. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Transactions on Software Engineering, 21(5):429-439, 1995.
29. M. Duflot, L. Fribourg, and C. Picaronny. Randomized finite-state distributed algorithms as Markov chains. In J. Welch, editor, Proc. Distributed Computing (DISC'2001), volume 2180 of LNCS, pages 240-254. Springer, 2001.
30. M. Duflot, L. Fribourg, and C. Picaronny. Randomized dining philosophers without fairness assumption. In Proc. IFIP Int. Conf. Theoretical Computer Science (TCS'02), volume 223 of IFIP Conference Proceedings, pages 169-180. Kluwer Academic, 2002.
31. Failures divergence refinement (FDR2). Formal Systems (Europe) Limited, http://www.formal.demon.co.uk/FDR2.html.
32. W. Feller. An Introduction to Probability Theory and its Applications, volume 1. John Wiley & Sons, 1950.
33. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(5):374-382, 1985.
34. K. Folegati and R. Segala. Coin lemmas with random variables. In de Alfaro and Gilmore [24], pages 71-86.
35. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
36. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proc. Real-Time Systems Symposium, pages 278-287. IEEE Computer Society Press, 1990.
37. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(4):512-535, 1994.
38. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380, 1983.
39. A preliminary version appeared in Proc. ACM Symp. Principles of Programming Languages, pages 1-6, 1982.
40. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Proc. Symp. Logic in Computer Science (LICS'98), pages 394-106. IEEE Computer Society Press, 1992.
41. T. Henzinger, S. Qadeer, and S. Rajamani. You assume, we guarantee: Methodology and case studies. In A. Hu and M. Vardi, editors, Proc. Computer-aided Verification (CAV'98), volume 1427 of LNCS, pages 440-451. Springer, 1998.
42. T. Herman. Probabilistic self stabilisation. Information Processing Letters, 35(2):63-67, 1990.
43. H. Hermanns and R. Segala, editors. Proc. Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02), volume 2399 of LNCS. Springer, 2002.
44. Joe Hurd. Verification of the Miller-Rabin probabilistic primality test. In R. Boulton and P. Jackson, editors, TPHOLs 2001: Supplemental Proceedings, number EDI-INF-RR-0046 in Informatics Report Series, pages 223-238. Division of Informatics, University of Edinburgh, 2001.
45. Joe Hurd. Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge, 2002.
46. Michael Huth and Marta Kwiatkowska. Quantitative analysis and model checking. In Proc. Symp. Logic in Computer Science (LICS'97), pages 111-122. IEEE Computer Society Press, 1997.
47. IEEE Computer Society. IEEE Standard for a High Performance Serial Bus. Std 1394-1995. August 1996.
48. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In Proc. Symp. Principles of Distributed Computing (PODC'90), pages 119-131. ACM Press, 1990.
49. B. Jonnsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. Symp. Logic in Computer Science (LICS'91), pages 266-277. IEEE Computer Society Press, 1991.
50. B. Jonsson and J. Parrow, editors. Proc. Int. Conf. Concurrency Theory (CONCUR'94), volume 836 of LNCS. Springer, 1994.
51. Y. Kesten and A. Pnueli. Control and data abstraction: the cornerstone of practical formal verification. Software Tools for Technology Transfer, 4(2):328-342, 2000.
52. Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck. Network invariants in action. In L. Brim, P. Jancar, M. Kretinsky, and A. Kucera, editors, Proc. CONCUR'02 - Concurrency Theory, volume 2421 of LNCS, pages 101-115. Springer, 2002.
53. E. Kushilevitz and M. Rabin. Randomized mutual exclusion algorithm revisited. In PODC92 [80], pages 275-284.
54. M. Kwiatkowska and G. Norman. Verifying randomized Byzantine agreement. In D. Peled and M. Vardi, editors, Proc. Formal Techniques for Networked and Distributed Systems (FORTE'02), volume 2529 of LNCS, pages 194-209. Springer, 2002.
55. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In T. Field, P. Harrison, J. Bradley, and U. Harder, editors, Proc. Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02), volume 2324 of LNCS, pages 200-204. Springer, April 2002.
56. M. Kwiatkowska, G. Norman, and R. Segala. Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In G. Berry, H. Comon, and A. Finkel, editors, Proc. Int. Conf. Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 194-206. Springer, 2001.
57. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150, 2002.
58. M. Kwiatkowska, G. Norman, and J. Sproston. Symbolic computation of maximal probabilistic reachability. In Larsen and Nielsen [60], pages 169-183.
59. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Special Issue of Formal Aspects of Computing, 2002. To appear.
60. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In Hermanns and Segala [42], pages 169-187.
61. K. Larsen and M. Nielsen, editors. Proc. CONCUR'01: Concurrency Theory, volume 2154 of LNCS. Springer, 2001.
62. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
63. Preliminary version of this paper appeared in Proc. 16th Annual ACM Symposium on Principles of Programming Languages, pages 134-352, 1989.
64. R. Lassaigne and S. Peyronnet. Approximate verification of probabilistic systems. In Hermanns and Segala [42], pages 213-214.
65. D. Lehmann and M. Rabin. On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem (extended abstract). In Proc. Symp. on Principles of Programming Languages (POPL'81), pages 133-138. ACM Press, 1981.
66. G. Lowe. Probabilities and Priorities in Timed CSP. PhD thesis, Oxford University Computing Laboratory, 1993.
67. G. Lowe. Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford University Computing Laboratory, 1993.
68. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
69. N. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proc. Symp. Principles of Distributed Computing (PODC'94), pages 314-323. ACM Press, 1994.
70. A. McIver. Quantitative program logic and expected time bounds in probabilistic distributed algorithms. Theoretical Computer Science, 282:191-219, 2002.
71. A. McIver and C. Morgan. An expectation-based model for probabilistic temporal logic. Logic Journal of the IGPL, 7(6):779-804, 1999.
72. A. McIver, C. Morgan, and E. Troubitsyna. The probabilistic steam boiler: a case study in probabilistic data refinement. In J. Grundy, M. Schwenke, and T. Vickers, editors, Proc. Int. Refinement Workshop and Formal Methods Pacific 1998, Discrete Mathematics and Theoretical Computer Science, pages 250-265. Springer, 1998.
73. K. McMillan. Verification of infinite state systems by compositional model checking. In L. Pierre and T. Kropf, editors, Proc. Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'99), volume 1703 of LNCS, pages 219-233. Springer, 1999.
74. K. McMillan. A methodology for hardware verification using compositional model checking. Science of Computer Programming, 37(1-3):279-309, 2000.
75. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
76. C. Morgan and A. McIver. pGL: Formal reasoning for randomized distributed algorithms. South African Computer Journal, pages 14-27, 1999.
77. C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, 1996.
78. C. Morgan, A. McIver, K. Seidel, and J. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617-647, 1996.
79. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
80. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
81. A. Pnueli and L. Zuck. Probabilistic verification. Information and Computation, 103:1-29, 1993.
82. Proc. Symp. Principles of Distributed Computing (PODC'92). ACM Press, 1992.
83. A. Pogosyants and R. Segala. Formal verification of timed properties of randomized distributed algorithms. In Proc. Symp. Principles of Distributed Computing (PODC'95), pages 174-183. ACM Press, 1995.
84. A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155-186, 2000.
85. ∼dxp/prism/.
86. 2 N-valued shared variable. Journal of Computer and System Sciences, 25(1):66-75, 1982.
87. M. O. Rabin. Probabilistic algorithms. In J. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 21-39. Academic Press, New York, 1976.
88. RAPTURE web page. http://www.irisa.fr/prive/bjeannet/prob/prob.html.
89. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC), 1(1):66-92, 1998.
90. A. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
91. A. Saias. Randomness versus Non-Determinism in Distributed Computing. PhD thesis, Massachusetts Institute of Technology, 1994.
92. I. Saias. Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion. In PODC92 [80], pages 263-274.
93. R. Segala. Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
94. R. Segala. The essence of coin lemmas. In Baier et al. [6].
95. R. Segala. Verification of randomized distributed algorithms. In E. Brinksma, H. Hermanns, and J.-P. Katoen, editors, Lectures on Formal Methods and Performance Analysis (First EEF/Euro Summer School on Trends in Computer Science), volume 2090 of LNCS, pages 232-260. Springer, 2001.
96. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Jonsson and Parrow [49], pages 481-496.
97. V. Shmatikov. Probabilistic analysis of anonymity. In Proc. Computer Security Foundations Workshop (CSFW'02), pages 119-128. IEEE Computer Society Press, 2002.
98. V. Shoup. Practical threshold signatures. In B. Preneel, editor, Proc. Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 207-220. Springer, 2000.
99. T. Speed. Probabilistic risk assessment in the nuclear industry : WASH-1400 and beyond. In L. LeCam and R. Olshen, editors, Proc. Berkeley Conference in honour of Jerzy Neyman and Jack Kiefer. Wadsworth Inc., 1985.
100. E. Stark and G. Pemmasani. Implementation of a compositional performance analysis algorithm for probabilistic I/O automata. In J. Hillston and M. Silva, editors, Proc. Int. Workshop Process Algebra and Performance Modelling (PAPM'99), pages 3-24. Prensas Universitarias de Zaragoza, 1999.
101. E. Stark and S. Smolka. Compositional analysis of expected delays in networks of probabilistic I/O automata. In Proc. Symp. Logic in Computer Science (LICS'98), pages 466-477. IEEE Computer Society Press, 1988.
102. M. Stoelinga and F. Vaandrager. Root contention in IEEE 1394. In J.-P. Katoen, editor, Proc. AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), volume 1601 of LNCS, pages 53-74. Springer, 1999.
103. M. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. Symp. Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.
104. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. Symp. Logic in Computer Science (LICS'86), pages 332-344. IEEE Computer Society Press, 1986.
105. S-H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviour of probabilistic I/O automata. In Jonsson and Parrow [49], pages 513-528.
106. Wang Yi and K.G. Larsen. Testing probabilistic and non-deterministic processes. In R. Linn Jr. and M. Ümit Uyar, editors, Protocol Specification, Testing and Verification, volume C-8 of IFIP Transactions, pages 47-61. North-Holland, 1992.
107. L. Zuck, A. Pnueli, and Y. Kesten. Automatic verification of probabilistic free choice. In A. Cortesi, editor, Proc. Verification, Model Checking, and Abstract Interpretation, Third International Workshop (VMCAI 2002), volume 2294 of LNCS, pages 208-224. Springer, 2002.