Skip to main content
SpringerLink
Log in

Analysing Randomized Distributed Algorithms

  • Chapter
Validation of Stochastic Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2925))

Abstract

Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, message routing and cache management. The appeal of randomized algorithms is their simplicity and elegance. However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distributed computation. This arises through the interplay between probability and nondeterminism. To prove a randomized distributed algorithm correct one usually involves two levels: classical, assertion-based reasoning, and a probabilistic analysis based on a suitable probability space on computations. In this paper we describe a number of approaches which allows us to verify the correctness of randomized distributed algorithms.

Supported in part by the EPSRC grant GR/N22960.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, S., Kutten, S.: Time-optimal self stabilizing spanning tree algorithms. In: Shyamasundar, R. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 15–17. Springer, Heidelberg (1993)

    Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for probabilistic real-time systems. In: Albert, J., Monien, B., Rodrf́8guez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 115–136. Springer, Heidelberg (1991)

    Google Scholar 

  3. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Alur, R., Henzinger, T.: Reactive modules. Formal Methods in System Design 15, 7–48 (1999)

    Article  Google Scholar 

  5. Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. Journal of Algorithms 11(3), 441–460 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Baier, C., Huth, M., Kwiatkowska, M., Ryan, M. (eds.): Proc. Int. Workshop Probabilistic Methods in Verification (PROBMIV 1998). ENTCS, vol. 22. Elsevier Science, Amsterdam (1998)

    Google Scholar 

  7. Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11, 125–155 (1998)

    Article  Google Scholar 

  8. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. Symp. Principles of Distributed Computing (PODC 1983), pp. 27–30. ACM Press, New York (1983)

    Chapter  Google Scholar 

  9. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 499–513. Springer, Heidelberg (1995)

    Google Scholar 

  10. Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524–541. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography (extended abstract). In: Proc. Symp. Principles of Distributed Computing (PODC 2000), pp. 123–132. ACM Press, New York (2000)

    Chapter  Google Scholar 

  12. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  13. Cleaveland, R., Smolka, S., Zwarico, A.: Testing preorders for probabilistic processes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 708–719. Springer, Heidelberg (1992)

    Google Scholar 

  14. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. Symp. Principles of Programming Languages (POPL1977), pp. 238–252. ACM Press, New York (1977)

    Google Scholar 

  16. Creese, S., Roscoe, A.: Data independent induction over structured networks. In: Arabnia, H. (ed.) Proc. Int. Conf. Parallel and Distributed Processing Techniques and Applications PDPTA 2000, vol. 2. CSREA Press (2000)

    Google Scholar 

  17. D’Argenio, P., Jeannet, B., Jensen, H., Larsen, K.: Reachability analysis of probabilistic systems by successive refinements. In: de Alfaro, Gilmore [24], pp. 39–56

    Google Scholar 

  18. D’Argenio, P., Jeannet, B., Jensen, H., Larsen, K.: Reduction and refinement strategies for probabilistic anylsis. In :Hermanns, Segala [42], pp. 57–76

    Google Scholar 

  19. Daws, C., Kwiatkowska, M., Norman, G.: Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In: Proc. Int. Workshop Formal Methods for Industrial Critical Systems (FMICS 2002). ENTCS, vol. 66(2). Elsevier Science, Amsterdam (2002)

    Google Scholar 

  20. de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)

    Google Scholar 

  21. de Alfaro, L.: Temporal logics for the specification of performance and reliability. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 165–176. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  22. de Alfaro,L.: From fairness to chance. In: Baier et al. [6]

    Google Scholar 

  23. de Alfaro, L.: How to specify and verify the long-run average behaviour of probabilistic systems. In: Proc. Symp. Logic in Computer Science (LICS 1998), pp. 454–465. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  24. de Luca, L., Gilmore, S. (eds.): PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165. Springer, Heidelberg (2001)

    Google Scholar 

  25. de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen and Nielsen [60], pp. 351–365

    Google Scholar 

  26. Derman, C.: Finite-State Markovian Decision Processes. Academic Press, New York (1970)

    MATH  Google Scholar 

  27. Dijkstra, E.: A Discipine of Programming. Prentice Hall International, Englewood Cliffs (1976)

    Google Scholar 

  28. Dolev, S., Israeli, A., Moran, S.: Analyzing expected time by scheduler-luck games. IEEE Transactions on Software Engineering 21(5), 429–439 (1995)

    Article  Google Scholar 

  29. Duflot, M., Fribourg, L., Picaronny, C.: Randomized finite-state distributed algorithms as markov chains. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 240–254. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  30. Duflot, M., Fribourg, L., Picaronny, C.: Randomized dining philosophers without fairness assumption. In: Proc. IFIP Int. Conf. Theoretical Computer Science TCS 2002. IFIP Conference Proceedings, vol. 223, pp. 169–180. Kluwer Academic, Dordrecht (2002)

    Google Scholar 

  31. Failures divergence refinement (FDR2). Formal Systems (Europe) Limited, http://www.formal.demon.co.uk/FDR2.html

  32. Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1. John Wiley & Sons, Chichester (1950)

    MATH  Google Scholar 

  33. Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(5), 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  34. Folegati, K., Segala, R.: Coin lemmas with random variables. In: de Alfaro, Gilmore [24], pp. 71–86

    Google Scholar 

  35. Hansson, H.: Time and Probability in Formal Design of Distributed Systems. Elsevier, Amsterdam (1994)

    Google Scholar 

  36. Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proc. Real-Time Systems Symposium, pp. 278–287. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  37. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6(4), 512–535 (1994)

    Article  MATH  Google Scholar 

  38. Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems 5(3), 356–380 (1983); A preliminary version appeared. In: Proc. ACM Symp. Principles of Programming Languages, pp. 1–6 (1982)

    Google Scholar 

  39. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. In: Proc. Symp. Logic in Computer Science (LICS 1998), pp. 394–406. IEEE Computer Society Press, Los Alamitos (1992)

    Google Scholar 

  40. Henzinger, T., Qadeer, S., Rajamani, S.: You assume, we guarantee: Methodology and case studies. In: Hu, A., Vardi, M. (eds.) CAV 1998. LNCS, vol. 1427, pp. 440–451. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  41. Herman, T.: Probabilistic self stabilisation. Information Processing Letters 35(2), 63–67 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  42. Hermanns, H., Segala, R.: PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399. Springer, Heidelberg (2002)

    Book  Google Scholar 

  43. Hurd, J.: Verification of the Miller-Rabin probabilistic primality test. In: Boulton, R., Jackson, P. (eds.) TPHOLs 2001: Supplemental Proceedings, number EDI-INF-RR-0046 in Informatics Report Series, Division of Informatics, University of Edinburgh, pp. 223–238 (2001)

    Google Scholar 

  44. Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge (2002)

    Google Scholar 

  45. Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proc. Symp. Logic in Computer Science LICS 1997, pp. 111–122. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  46. IEEE Computer Society. IEEE Standard for a High Performance Serial Bus. Std 1394–1995 (August 1996)

    Google Scholar 

  47. Israeli, A., Jalfon, M.: Token management schemes and random walks yield selfstabilizing mutual exclusion. In: Proc. Symp. Principles of Distributed Computing PODC 1990, pp. 119–131. ACM Press, New York (1990)

    Chapter  Google Scholar 

  48. Jonnsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. Symp. Logic in Computer Science LICS 1991, pp. 266–277. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  49. Jonsson, B., Parrow, J. (eds.): CONCUR 1994. LNCS, vol. 836. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  50. Kesten, Y., Pnueli, A.: Control and data abstraction: the cornerstone of practical formal verification. Software Tools for Technology Transfer 4(2), 328–342 (2000)

    Google Scholar 

  51. Kesten, Y., Pnueli, A., Shahar, E., Zuck, L.: Network invariants in action. In: Brim, L., Jancar, P., Kretinsky, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 101–115. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  52. Kushilevitz, E., Rabin, M.: Randomized mutual exclusion algorithm revisited. In: PODC 1992 [80] pp. 275–284

    Google Scholar 

  53. Kwiatkowska, M., Norman, G.: Verifying randomized Byzantine agreement. In: Peled, D., Vardi, M. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 194–209. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  54. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200–204. Springer, Heidelberg (2002)

    Google Scholar 

  55. Kwiatkowska, M., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 194–206. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  56. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282, 101–150 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  57. Kwiatkowska, M., Norman, G., Sproston, J.: Symbolic computation of maximal probabilistic reachability. In: Larsen, Nielsen [60], pp. 169–183

    Google Scholar 

  58. Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Special Issue of Formal Aspects of Computing (2002) (to appear)

    Google Scholar 

  59. Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In: Hermanns, Segala [42], pp. 169–187

    Google Scholar 

  60. Larsen, K., Nielsen, M. (eds.): CONCUR 2001. LNCS, vol. 2154. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  61. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991); Preliminary version of this paper appeared. In: Proc. 16th Annual ACM Symposium on Principles of Programming Languages, pp. 134–352 (1989)

    Google Scholar 

  62. Lassaigne, R., Peyronnet, S.: Approximate verification of probabilistic systems. In: Hermanns, Segala [42], pp. 213–214

    Google Scholar 

  63. Lehmann, D., Rabin, M.: 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 1981, pp. 133–138. ACM Press, New York (1981)

    Google Scholar 

  64. Lowe, G.: Probabilities and Priorities in Timed CSP. PhD thesis, Oxford University Computing Laboratory (1993)

    Google Scholar 

  65. Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford University Computing Laboratory (1993)

    Google Scholar 

  66. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  67. Lynch, N., Saias, I., Segala, R.: Proving time bounds for randomized distributed algorithms. In: Proc. Symp. Principles of Distributed Computing PODC 1994, pp. 314–323. ACM Press, New York (1994)

    Chapter  Google Scholar 

  68. McIver, A.: Quantitative program logic and expected time bounds in probabilistic distributed algorithms. Theoretical Computer Science 282, 191–219 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  69. McIver, A., Morgan, C.: An expectation-based model for probabilistic temporal logic. Logic Journal of the IGPL 7(6), 779–804 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  70. McIver, A., Morgan, C., Troubitsyna, E.: The probabilistic steam boiler: a case study in probabilistic data refinement. In: Grundy, J., Schwenke, M., Vickers, T. (eds.) Proc. Int. Refinement Workshop and Formal Methods Pacific 1998, Discrete Mathematics and Theoretical Computer Science, pp. 250–265. Springer, Heidelberg (1998)

    Google Scholar 

  71. McMillan, K.: Verification of infinite state systems by compositional model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 219–237. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  72. McMillan, K.: A methodology for hardware verification using compositional model checking. Science of Computer Programming 37(1–3), 279–309 (2000)

    Article  MATH  Google Scholar 

  73. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  74. Morgan, C., McIver, A.: pGL: Formal reasoning for randomized distributed algorithms. South African Computer Journal, 14–27 (1999)

    Google Scholar 

  75. Morgan, C., McIver, A., Seidel, K.: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18(3), 325–353 (1996)

    Article  Google Scholar 

  76. Morgan, C., McIver, A., Seidel, K., Sanders, J.: Refinement-oriented probability for CSP. Formal Aspects of Computing 8(6), 617–647 (1996)

    Article  MATH  Google Scholar 

  77. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  78. Pnueli, A., Zuck, L.: Verification of multiprocess probabilistic protocols. Distributed Computing 1(1), 53–72 (1986)

    Article  MATH  Google Scholar 

  79. Pnueli, A., Zuck, L.: Probabilistic verification. Information and Computation 103, 1–29 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  80. Proc. Symp. Principles of Distributed Computing (PODC 1992). ACM Press, New York (1992)

    Google Scholar 

  81. Pogosyants, A., Segala, R.: Formal verification of timed properties of randomized distributed algorithms. In: Proc. Symp. Principles of Distributed Computing PODC 1995. ACM Press, New York (1995)

    Google Scholar 

  82. Pogosyants, A., Segala, R., Lynch, N.: Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing 13(3), 155–186 (2000)

    Article  Google Scholar 

  83. PRISM web page, http://www.cs.bham.ac.uk/~dxp/prism/

  84. Rabin, M.: N-process mutual exclusion with bounded waiting by 4 log2 N-valued shared variable. Journal of Computer and System Sciences 25(1), 66–75 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  85. Rabin, M.O.: Probabilistic algorithms. In: Traub, J. (ed.) Algorithms and Complexity: New Directions and Recent Results, pp. 21–39. Academic Press, New York (1976)

    Google Scholar 

  86. RAPTURE web page, http://www.irisa.fr/prive/bjeannet/prob/prob.html

  87. Reiter, M., Rubin, A.: Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC) 1(1), 66–92 (1998)

    Article  Google Scholar 

  88. Roscoe, A.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)

    Google Scholar 

  89. Saias, A.: Randomness versus Non-Determinism in Distributed Computing. PhD thesis, Massachusetts Institute of Technology (1994)

    Google Scholar 

  90. Saias, I.: Proving probabilistic correctness statements: the case of Rabin’s algorithm for mutual exclusion. In: Proc. Symp. Principles of Distributed Computing PODC 1992, pp. 263–274 (1992)

    Google Scholar 

  91. Segala, R.: Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)

    Google Scholar 

  92. Segala, R., Baier, et al.: The essence of coin lemmas

    Google Scholar 

  93. Segala, R.: Verification of randomized distributed algorithms. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, pp. 232–260. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  94. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, Parrow [49], pp. 481–496

    Google Scholar 

  95. Shmatikov, V.: Probabilistic analysis of anonymity. In: Proc. Computer Security Foundations Workshop CSFW 2002, pp. 119–128. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  96. Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  97. Speed, T.: Probabilistic risk assessment in the nuclear industry: WASH-1400 and beyond. In: LeCam, L., Olshen, R. (eds.) Proc. Berkeley Conference in honour of Jerzy Neyman and Jack Kiefer, Wadsworth Inc. (1985)

    Google Scholar 

  98. Stark, E., Pemmasani, G.: Implementation of a compositional performance analysis algorithm for probabilistic I/O automata. In: Hillston, J., Silva, M. (eds.) Proc. Int. Workshop Process Algebra and Performance Modelling PAPM 1999, Prensas Universitarias de Zaragoza, pp. 3–24 (1999)

    Google Scholar 

  99. Stark, E., Smolka, S.: Compositional analysis of expected delays in networks of probabilistic I/O automata. In: Proc. Symp. Logic in Computer Science LICS 1998, pp. 466–477. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  100. Stoelinga, M., Vaandrager, F.: Root contention in IEEE 1394. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 53–74. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  101. Vardi, M.: Automatic verification of probabilistic concurrent finite state programs. In: Proc. Symp. Foundations of Computer Science FOCS 1985, pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)

    Chapter  Google Scholar 

  102. Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. Symp. Logic in Computer Science LICS 1986, pp. 332–344. IEEE Computer Society Press, Los Alamitos (1986)

    Google Scholar 

  103. Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviour of probabilistic I/O automata. In: Jonsson, Parrow [49], pp. 513–528

    Google Scholar 

  104. Yi, W., Larsen, K.G.: Testing probabilistic and non-deterministic processes. In: Linn Jr., R., Ümit Uyar, M. (eds.) Protocol Specification, Testing and Verification. IFIP Transactions, vol. C-8, pp. 47–61. North-Holland, Amsterdam (1992)

    Google Scholar 

  105. Zuck, L., Pnueli, A., Kesten, Y.: Automatic verification of probabilistic free choice. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 208–224. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom

    Gethin Norman

Authors
  1. Gethin Norman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science, Technical University Dresden, Germany

    Christel Baier

  2. Centre for Telematics and Information Technology, Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500, AE, Netherlands

    Boudewijn R. Haverkort

  3. VASY, INRIA, Grenoble Rhône-Alpes, France

    Holger Hermanns

  4. Software Modeling and Verification, RWTH Aachen University, Germany

    Joost-Pieter Katoen

  5. Institut für Technische Informatik, Universität der Bundeswehr München,  

    Markus Siegle

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Norman, G. (2004). Analysing Randomized Distributed Algorithms . In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, JP., Siegle, M. (eds) Validation of Stochastic Systems. Lecture Notes in Computer Science, vol 2925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24611-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24611-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22265-1

  • Online ISBN: 978-3-540-24611-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation