Skip to main content

Compositionality for Probabilistic Automata

  • Conference paper
CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:


We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Aggarwal, S.: Time optimal self-stabilizing spanning tree algorithms. Master’s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Available as Technical Report MIT/LCS/TR- 632 (May 1994)

    Google Scholar 

  2. Larsen, K.G., Jonsson, B.: Specification and refinement of probabilistic processes. In: Proceedings 6th Annual Symposium on Logic in Computer Science, Amsterdam, pp. 266–277. IEEE Press, Los Alamitos (1991)

    Google Scholar 

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

    Google Scholar 

  4. Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. Technical Report MIT-LCS-TR-907, MIT, Laboratory for Computer Science (2003)

    Google Scholar 

  5. Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2(3), 219–246 (1989)

    MATH  MathSciNet  Google Scholar 

  6. Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations, I: Untimed systems. Information and Computation 121(2), 214–233 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  8. Segala, R.: Compositional trace–based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 234–248. Springer, Heidelberg (1995)

    Google Scholar 

  9. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Available as Technical Report MIT/LCS/TR-676 (June 1995)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  11. Stoelinga, M.I.A.: Alea jacta est: Verification of Probabilistic, Real-Time and Parametric Systems. PhD thesis, University of Nijmegen (April 2002)

    Google Scholar 

  12. Stoelinga, M.I.A.: An introduction to probabilistic automata. Bulletin of the European Association for Theoretical Computer Science 78, 176–198 (2002)

    MATH  MathSciNet  Google Scholar 

  13. Stoelinga, M.I.A., Vaandrager, F.W.: 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 

  14. Stoelinga, M.I.A., Vaandrager, F.W.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 407–418. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, N., Segala, R., Vaandrager, F. (2003). Compositionality for Probabilistic Automata. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40753-9

  • Online ISBN: 978-3-540-45187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics