Skip to main content
SpringerLink
Log in

Compositional Verification of Randomized Distributed Algorithms

  • Conference paper
  • First Online:
Book cover Compositionality: The Significant Difference (COMPOS 1997)

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

Included in the following conference series:

Abstract

We study compositionality issues for the analysis of randomized distributed algorithms. We identify three forms of compositionality that we call process compositionality, property compositionality, and feature compositionality. Process and property compositionality are widely known in the literature, while feature compositionality, although used extensively, does not appear to be emphasized as much. We show how feature compositionality is important for the analysis of randomized systems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, MIT Laboratory for Computer Science, 1994. Master’s thesis.

    Google Scholar 

  2. J. Aspnes and M.P. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 15(1):441–460, September 1990.

    Google Scholar 

  3. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. In Cleaveland [11], pages 472–485.

    Chapter  Google Scholar 

  4. J.C.M. Baeten and J.W. Klop, editors. Proceedings of CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

    MATH  Google Scholar 

  5. J.C.M. Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

    Google Scholar 

  6. K.M. Chandi and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  7. I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In J.W. Klop, editors. Proceedings of CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990 Baeten and Klop [4], pages 126–140.

    Google Scholar 

  8. I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Science, Uppsala University, 1990.

    Google Scholar 

  9. L. Christoff. Specification and Verification Methods for Probabilistic Processes. PhD thesis, Department of Computer Science, Uppsala University, 1993.

    Google Scholar 

  10. R. Cleaveland, S.A. Smolka, and A. Zwarico. Testing preorders for probabilistic processes (extended abstract). In Proceedings 19 th ICALP, Madrid, volume 623 of Lecture Notes in Computer Science, pages 708–719. Springer-Verlag, 1992.

    Google Scholar 

  11. W.R. Cleaveland, editor. Proceedings of CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  12. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. LEEE Transactions on Parallel and Distributed Systems, 8(4):424–440, April 1997.

    Google Scholar 

  13. W. Feller. An Introduction to Probability Theory and its Applications. Volume 1. Jokn Wiley & Sons, Inc., 1950.

    Google Scholar 

  14. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with a family of faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Google Scholar 

  15. A. Giacalone, C.C Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of the Working Conference on Programming Concepts and Methods (LFLP TC2), Sea of Galilee, Israel, 1990.

    Google Scholar 

  16. R.J. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(l):59–80, 1996.

    Google Scholar 

  17. H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994.

    Google Scholar 

  18. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.

    MATH  Google Scholar 

  19. B. Jonsson and J. Parrow, editors. Proceedings of CONCUR 94, Uppsala, Sweden, volume 836 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  20. R. Keller. Formal verification of parallel programs. Communications of the ACM, 7(19):561–572, 1976.

    Google Scholar 

  21. E. Kushilevitz and M. Rabin. Randomized mutual exclusion algorithms revisited. In Proceedings of the 11 th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, pages 275–284, 1992.

    Google Scholar 

  22. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Conference Record of the 16 th ACM Symposium on Principles of Programming Languages, Austin, Texas, pages 344–352, 1989.

    Google Scholar 

  23. K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Cleaveland [11], pages 456–471.

    Chapter  Google Scholar 

  24. 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.

    Google Scholar 

  25. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13 th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, pages 314–323, 1994.

    Google Scholar 

  26. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, Vancouver, Canada, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.

    Google Scholar 

  27. Nancy Lynch and Frits Vaandrager. Forward and backward simulations-Part I: Untimed systems. Information and Computation, 121(2):214–233, September 1995.

    Google Scholar 

  28. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.

    MATH  Google Scholar 

  29. D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5 th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.

    Google Scholar 

  30. A. Pnueli. On the extremely fair treatment of probabilistic algorithms. In Proceedings of the 15 th Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, May 1983.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  32. A. Pogosyants and R. Segala. Formal verification of timed properties of randomized distributed algorithms. In Proceedings of the 14 th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, pages 174–183, August 1995.

    Google Scholar 

  33. A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Technical Memo MIT/LCS/TM-555, MIT Laboratory for Computer Science, 1997.

    Google Scholar 

  34. M.O. Rabin. Probabilistic automata. Information and Control, 6:230–245, 1963.

    Article  Google Scholar 

  35. J.R. Rao. Reasoning about probabilistic algorithms. In Proceedings of the 9 th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1990.

    Google Scholar 

  36. I. Saias. Proving probabilistic correctness: the case of Rabin’s algorithm for mutual exclusion. In Proceedings of the 11 th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1992.

    Google Scholar 

  37. R. Segala. A compositional trace-based semantics for probabilistic automata. In I. Lee and S.A. Smolka, editors, Proceedings of CONCUR 95, Philadelphia, PA, USA, volume 962 of Lecture Notes in Computer Science, pages 234–248. Springer-Verlag, 1995.

    Google Scholar 

  38. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept.of saElectrical Engineering and Computer Science, 1995. Also appears as technical report MIT/LCS/TR-676.

    Google Scholar 

  39. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.

    MATH  MathSciNet  Google Scholar 

  40. K. Seidel. Probabilistic communicating processes. Technical Report PRG-102, Ph.D. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1992.

    Google Scholar 

  41. K. Seidel, C. Morgan, and A. McIver. An introduction to probabilistic predicate transformers. Technical Report PRG-TR-6-96, Programming Research Group, Oxford University Computing Laboratory, 1996.

    Google Scholar 

  42. C. Tofts. A synchronous calculus of relative frequencies. In J.W. Klop, editors. Proceedings of CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990 Baeten and Klop [4].

    Google Scholar 

  43. 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.

    Google Scholar 

  44. S.H. Wu, S. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. In J. Parrow, editors. Proceedings of CONCUR 94, Uppsala, Sweden, volume 836 of Lecture Notes in Computer Science. Springer-Verlag, 1994 Jonsson and Parrow [19].

    Chapter  Google Scholar 

  45. W. Yi and K.G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47–61, 1992.

    Google Scholar 

  46. S. Yuen, R. Cleaveland, Z. Dayar, and S. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes. In J. Parrow, editors. Proceedings of CONCUR 94, Uppsala, Sweden, volume 836 of Lecture Notes in Computer Science. Springer-Verlag, 1994 Jonsson and Parrow [19].

    Chapter  Google Scholar 

  47. L. Zuck. Past Temporal Logic. PhD thesis, The Weizman Institute of Science, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Roberto Segala

Authors
  1. Roberto Segala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Applied Mathematics, Christian Albrechts University at Kiel, Preußerstr. 1-9, D-24105, Kiel, Germany

    Willem-Paul de Roever  & Hans Langmaack  & 

  2. Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, P.O. Box 26, Rehovot, 76100, Israel

    Amir Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Segala, R. (1998). Compositional Verification of Randomized Distributed Algorithms. In: de Roever, WP., Langmaack, H., Pnueli, A. (eds) Compositionality: The Significant Difference. COMPOS 1997. Lecture Notes in Computer Science, vol 1536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49213-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-49213-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65493-3

  • Online ISBN: 978-3-540-49213-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation