Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2002: CONCUR 2002 — Concurrency Theory pp 371–386Cite as

Decision Algorithms for Probabilistic Bisimulation*

  • Conference paper
  • First Online:

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

Abstract

We propose decision algorithms for bisimulation relations defined on probabilistic automata, a model for concurrent nondeterministic systems with randomization. The algorithms decide both strong and weak bisimulation relations based on deterministic as well as randomized schedulers. These algorithms extend and complete other known algorithms for simpler relations and models. The algorithm we present for strong probabilistic bisimulation has polynomial time complexity, while the algorithm for weak probabilistic bisimulation is exponential; however we argue that the latter is feasible in practice.

Supported in part by EPSRC grants GR/N22960 and GR/M13046

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. d. Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Available as Technical report STAN-CS-TR-98-1601.

    Google Scholar 

  2. C. Baier, B. Engelen, and M. E. Majster-Cederbaum. Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences, 60(1):187–231, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. Technical Report 99/12, University of Twente, 1999.

    Google Scholar 

  4. C. Baier and M. Stoelinga. Norm functions for bisimulations with delays. In Proceedings of FOSSACS. Springer-Verlag, 2000.

    Google Scholar 

  5. M. Bernardo, L. Donatiello, and R. Gorrieri. Modeling and analyzing concurrent systems with MPA. In Proceedings of the Second Workshop on Process Algebras and Performance Modelling (PAPM), Erlangen, Germany, pages 175–189, 1994.

    Google Scholar 

  6. K. Fukuda. Polyhedral computation FAQ. http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html, 2000.

  7. R. v. Glabbeek, S. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1), 1996.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. H. Hermanns, U. Herzog, and J. Katoen. Process algebra for performance evaluation. To appear in Theoretical Computer Science.

    Google Scholar 

  11. J. Hillston. PEPA: Performance enhanced process algebra. Technical Report CSR-24-93, Department of Computer Science, Univ. of Edimburgh (UK), 1993.

    Google Scholar 

  12. J. Hillston. A Compositional Approach to Performance Modeling. PhD thesis, Department of Computer Science, Univ. of Edimburgh (UK), 1994.

    Google Scholar 

  13. P. Kanellakis and S. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43–68, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica 4, pages 373–395, 1984.

    Google Scholar 

  15. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer-Verlag, second edition, 1976.

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  18. C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Trans. Prog. Lang. Syst., 18(3):325–353, May 1996.

    Article  Google Scholar 

  19. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973–989, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  20. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In Proceedings of CONCUR 2000, pages 334–349. Springer-Verlag, 2000.

    Google Scholar 

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

    Google Scholar 

  22. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Proceedings of CONCUR 94, pages 481–496. Springer-Verlag, 1994.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  25. S. Wu, S. Smolka, and E. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Comput. Sci., 176(1–2):1–38, 1999.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Stefano Cattani

  2. Dipartimento di Informatica, Università di Verona, Strada Le Grazie 15, 2 37134, Verona, Ca’Vignal, Italy

    Roberto Segala

Authors
  1. Stefano Cattani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Segala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cattani, S., Segala, R. (2002). Decision Algorithms for Probabilistic Bisimulation* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44043-7

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation