Skip to main content
SpringerLink
Log in

Deciding probabilistic bisimilarity over infinite-state probabilistic systems

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. For normed subclasses of probabilistic BPA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm needs only polynomial time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulla, P., Baier, C., Iyer, S., Jonsson, B.: Reasoning about probabilistic channel systems. In: Proceedings of CONCUR 2000. Lecture Notes in Computer Science, vol. 1877, pp. 320–330. Springer, Heidelberg (2000)

  2. Abdulla, P., Bertrand, N., Rabinovich, A., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2), 141–165 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Abdulla, P., Henda, N., Mayr, R.: Verifying infinite Markov chains with a finite attractor or the global coarseness property. In: Proceedings of LICS 2005, pp. 127–136. IEEE Computer Society Press, Washington (2005)

  4. Abdulla, P., Rabinovich, A.: Verification of probabilistic systems with faulty communication. In: Proceedings of FoSSaCS 2003. Lecture Notes in Computer Science, vol. 2620, pp. 39–53. Springer, Heidelberg (2003)

  5. de Alfaro, L., Kwiatkowska, M., Norman, G., Parker, D., Segala, R.: Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation. In: Proceedings of TACAS 2000. Lecture Notes in Computer Science, vol. 1785, pp. 395–410. Springer, Heidelberg (2000)

  6. Aziz, A., Singhal, V., Balarin, F., Brayton, R., Sangiovanni-Vincentelli, A.: It usually works: The temporal logic of stochastic systems. In: Proceedings of CAV’95. Lecture Notes in Computer Science, vol. 939, pp. 155–165. Springer, Heidelberg (1995)

  7. Baeten, J., Bergstra, J., Klop, J.: On the consistency of Koomen’s fair abstraction rule. Theo. Comput. Sci. 51(1), 129–176 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Baier, C., Bertrand, N., Schnoebelen, P.: A note on the attractor-property of infinite-state markov chains. Inf. Process. Lett. 97(2), 58–63 (2006)

    MathSciNet  Google Scholar 

  9. Baier, C., Engelen, B.: Establishing qualitative properties for probabilistic lossy channel systems: an algorithmic approach. In: Proceedings of 5th International AMAST Workshop on Real-Time and Probabilistic Systems (ARTS’99). Lecture Notes in Computer Science, vol. 1601, pp. 34–52. Springer, Heidelberg (1999)

  10. Baier, C., Hermanns, H., Katoen, J.: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett. 89(3), 123–130 (2004)

    Article  MathSciNet  Google Scholar 

  11. Bianco, A., de Alfaro, L.: Model checking of probabalistic and nondeterministic systems. In: Proceedings of FST&TCS’95. Lecture Notes in Computer Science, vol. 1026, pp. 499–513. Springer, Heidelberg (1995)

  12. Brázdil, T., Esparza, J., Kučera, A.: Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In: Proceedings of FOCS 2005, pp. 521–530. IEEE Computer Society Press, Washington (2005)

  13. Brázdil, T., Kučera, A.: Computing the expected accumulated reward and gain for a subclass of infinite Markov chains. In: Proceedings of FST&TCS 2005. Lecture Notes in Computer Science, vol. 3821, pp. 372–383. Springer, Heidelberg (2005)

  14. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra pp. 545–623 (1999)

  15. Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Proceedings of CONCUR 2002. Lecture Notes in Computer Science, vol. 2421, pp. 371–385. Springer, Heidelberg (2002)

  16. Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: Proceedings of FOCS’88, pp. 338–345. IEEE Computer Society Press, Washington (1988)

  17. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. Assoc. Comput. Mach. 42(4), 857–907 (1995)

    MATH  MathSciNet  Google Scholar 

  18. Esparza, J., Kučera, A., Mayr, R.: Model-checking probabilistic pushdown automata. In: Proceedings of LICS 2004, pp. 12–21. IEEE Computer Society Press, Washington (2004)

  19. Esparza, J., Kučera, A., Mayr, R.: Quantitative analysis of probabilistic pushdown automata: expectations and variances. In: Proceedings of LICS 2005, pp. 117–126. IEEE Computer Society Press, Washington (2005)

  20. Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic systems. In: Proceedings of TACAS 2005. Lecture Notes in Computer Science, vol. 3440, pp. 253–270. Springer, Heidelberg (2005)

  21. Etessami, K., Yannakakis, M.: Checking LTL properties of recursive Markov chains. In: Proceedings of 2nd International Conference on Quantitative Evaluation of Systems (QEST’05), pp. 155–165. IEEE Computer Society Press, Washington (2005)

  22. Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In: Proceedings of STACS’2005. Lecture Notes in Computer Science, vol. 3404, pp. 340–352. Springer, Heidelberg (2005)

  23. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. Comput. 6, 512–535 (1994)

    Article  MATH  Google Scholar 

  24. Hirshfeld, Y.: Congruences in commutative semigroups. Technical Report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh (1994)

  25. Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proceedings of LICS’97, pp. 111–122. IEEE Computer Society Press, Washington (1997)

  26. Iyer, S., Narasimha, M.: Probabilistic lossy channel systems. In: Proceedings of TAPSOFT’97. Lecture Notes in Computer Science, vol. 1214, pp. 667–681. Springer, Heidelberg (1997)

  27. Jonsson B., Yi W., Larsen, K.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra pp. 685–710 (1999)

  28. Kučera, A., Mayr, R.: A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. In: Proceedings of IFIP TCS’2004, pp. 395–408. Kluwer, Dordrecht (2004)

  29. Kwiatkowska, M.: Model checking for probability and time: from theory to practice. In: Proceedings of LICS 2003, pp. 351–360. IEEE Computer Society Press, Washington (2003)

  30. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1–28 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  31. Rabinovich, A.: Quantitative analysis of probabilistic lossy channel systems. In: Proceedings of ICALP 2003. Lecture Notes in Computer Science, vol. 2719, pp. 1008–1021. Springer, Heidelberg (2003)

  32. Rédei, L.: The Theory of Finitely Generated Commutative Semigroups. Pergamon, Oxford (1965)

    MATH  Google Scholar 

  33. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. NJC 2(2), 250–273 (1995)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tomáš Brázdil, Antonín Kučera & Oldřich Stražovský

Authors
  1. Tomáš Brázdil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonín Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oldřich Stražovský
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomáš Brázdil.

Additional information

The work has been supported by the research centre Institute for Theoretical Computer Science (ITI), project No. 1M0545.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brázdil, T., Kučera, A. & Stražovský, O. Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta Informatica 45, 131–154 (2008). https://doi.org/10.1007/s00236-007-0066-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-007-0066-8

Keywords

Search

Navigation