Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-nwzlb Total loading time: 0 Render date: 2024-03-29T00:24:07.739Z Has data issue: false hasContentIssue false

7 - Probabilistic bisimulation

Published online by Cambridge University Press:  05 November 2011

Prakash Panangaden
Affiliation:
McGill University
Davide Sangiorgi
Affiliation:
University of Bologna, Italy
Jan Rutten
Affiliation:
Stichting Centrum voor Wiskunde en Informatica (CWI), Amsterdam
Get access

Summary

Introduction

The history of bisimulation is well documented in earlier chapters of this book. In this chapter we will look at a major non-trivial extension of the theory of labelled transition systems: probabilistic transition systems. There are many possible extensions of theoretical and practical interest: real-time, quantitative, independence, spatial and many others. Probability is the best theory we have for handling uncertainty in all of science, not just computer science. It is not an idle extension made for the purpose of exploring what is theoretically possible. Non-determinism is, of course, important, and arises in computer science because sometimes we just cannot do any better or because we lack quantitative data from which to make quantitative predictions. However, one does not find any use of non-determinism in a quantitative science like physics, though it appears in sciences like biology where we have not yet reached a fundamental understanding of the nature of systems.

When we do have data or quantitative models, it is far preferable to analyse uncertainty probabilistically. A fundamental reason that we want to use probabilistic reasoning is that if we merely reported what is possible and then insisted that no bad things were possible, we would trust very few system designs in real life. For example, we would never trust a communication network, a car, an aeroplane, an investment bank nor would we ever take any medication! In short, only very few idealised systems ever meet purely logical specifications. We need to know the ‘odds’ before we trust any system.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[AM89] P., Aczel and N., Mendler. A final-coalgebra theorem. In Category Theory and Computer Science, number 389 in Lecture Notes in Computer Science, pages 357–365. Springer-Verlag, 1989.
[Arv76] W., Arveson. An Invitation to C*-Algebra. Springer-Verlag, 1976.
[Ash72] R.B., Ash. Real Analysis and Probability. Academic Press, 1972.
[BDEP97] R., Blute, J., Desharnais, A., Edalat, and P., Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the 12th IEEE Symposium On Logic In Computer Science, Warsaw, Poland, 1997.
[BH97] C., Baier and H., Hermanns. Weak bisimulation for fully probabilistic processes. In Proceedings of the 1997 International Conference on Computer Aided Verification, number 1254 in Lecture Notes in Computer Science. Springer-Verlag, 1997.
[BHHK00] C., Baier, B., Haverkort, H., Hermanns, and J.-P., Katoen. Model checking continuous-time Markov chains by transient analysis. In CAV 2000: Proceedings of the 12th Annual Symposium on Computer-Aided Verification, number 1855 in Lecture Notes in Computer Science, pages 358–372. Springer-Verlag, 2000.
[Bil95] P., Billingsley. Probability and Measure. Wiley-Interscience, 1995.
[BSdV04] F., Bartels, A., Sokolova, and E.P., Vink. A hierarchy of probabilistic system types. Theoretical Computer Science, 327:3–22, 2004.Google Scholar
[DDLP06] V., Danos, J., Desharnais, F., Laviolette, and P., Panangaden. Bisimulation and cocongruence for probabilistic systems. Information and Computation, 204(4):503–523, 2006.Google Scholar
[DEP98] J., Desharnais, A., Edalat, and P., Panangaden. A logical characterization of bisimulation for labelled Markov processes. In Proceedings of the 13th IEEE Symposium on Logic in Computer Science, Indianapolis, pages 478–489. IEEE Press, June 1998.
[DEP02] J., Desharnais, A., Edalat, and P., Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 179(2):163–193, 2002.Google Scholar
[DGJP99] J., Desharnais, V., Gupta, R., Jagadeesan, and P., Panangaden. Metrics for labeled Markov systems. In Proceedings of CONCUR99, number 1664 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
[DGJP00] J., Desharnais, V., Gupta, R., Jagadeesan, and P., Panangaden. Approximation of labeled Markov processes. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pages 95–106. IEEE Computer Society Press, June 2000.
[DGJP02a] J., Desharnais, V., Gupta, R., Jagadeesan, and P., Panangaden. The metric analogue of weak bisimulation for labelled Markov processes. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 413–422, July 2002.
[DGJP02b] J., Desharnais, V., Gupta, R., Jagadeesan, and P., Panangaden. Weak bisimulation is sound and complete for pCTL*. In L., Brim, P., Jancar, M., Kretinsky, and A., Kucera, editors, Proceedings of 13th International Conference on Concurrency Theory, CONCUR02, number 2421 in Lecture Notes in Computer Science, pages 355–370. Springer-Verlag, 2002.
[DGJP03] J., Desharnais, V., Gupta, R., Jagadeesan, and P., Panangaden. Approximating labeled Markov processes. Information and Computation, 184(1):160–200, 2003.Google Scholar
[Dob03] E.-E., Doberkat. Semi-pullbacks and bisimulations in categories of stochastic relations. In J.C.M., Baeten, J.K., Lenstra, J., Parrow, and G.J., Woeinger, editors, Proceedings of the 27th International Colloquium On Automata Languages And Programming, ICALP'03, number 2719 in Lecture Notes in Computer Science, pages 996–1007. Springer-Verlag, July 2003.
[Dob10] E.-E., Doberkat. Stochastic Coalgebraic Logic. Springer-Verlag, 2010.
[DP03] J., Desharnais and P., Panangaden. Continuous stochastic logic characterizes bisimulation for continuous-time Markov processes. Journal of Logic and Algebraic Progamming, 56:99–115, 2003. Special issue on Probabilistic Techniques for the Design and Analysis of Systems.Google Scholar
[Dud89] R.M., Dudley. Real Analysis and Probability. Wadsworth and Brookes/Cole, 1989.
[dVR97] E., Vink and J.J.M.M., Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. In Proceedings of the 24th International Colloquium on Automata Languages and Programming, 1997.
[dVR99] E., Vink and J.J.M.M., Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221(1/2):271–293, June 1999.Google Scholar
[Eda99] A., Edalat. Semi-pullbacks and bisimulation in categories of Markov processes. Mathematical Structures in Computer Science, 9(5):523–543, 1999.Google Scholar
[FPP04] N., Ferns, P., Panangaden, and D., Precup. Metrics for finite Markov decision precesses. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pages 162–169, July 2004.
[FPP05] N., Ferns, P., Panangaden, and D., Precup. Metrics for Markov decision processes with infinite state spaces. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, pages 201–208, July 2005.
[Gir81] M., Giry. A categorical approach to probability theory. In B., Banaschewski, editor, Categorical Aspects of Topology and Analysis, number 915 in Lecture Notes in Mathematics, pages 68–85. Springer-Verlag, 1981.
[GJP04] V., Gupta, R., Jagadeesan, and P., Panangaden. Approximate reasoning for real-time probabilistic processes. In The Quantitative Evaluation of Systems, First International Conference QEST04, pages 304–313. IEEE Press, 2004.
[GJP06] V., Gupta, R., Jagadeesan, and P., Panangaden. Approximate reasoning for real-time probabilistic processes. Logical Methods in Computer Science, 2(1):paper 4, 2006.Google Scholar
[Hal74] P., Halmos. Measure Theory. Number 18 in Graduate Texts in Mathematics. Springer-Verlag, 1974. Originally published in 1950.
[HCHC02] B.R., Haverkort, L., Cloth, H., Hermans, J.-P., Katoen, and C., Baier. Model checking performability properties. In Proceedings of the International Conference on Dependable Systems and Networks 2002, pages 102–113. IEEE Computer Society, June 2002.
[Hil94] J., Hillston. A compositional approach to performance modelling. PhD thesis, University of Edinburgh, 1994. Published as a Distinguished Dissertation by Cambridge University Press in 1996.
[HJ94] J., Hoffman-Jørgenson. Probability With a View Towards Applications – Two volumes. Chapman and Hall, 1994.
[JNW93] A., Joyal, M., Nielsen, and G., Winskel. Bisimulation and open maps. In Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science, pages 418–427, 1993.
[JS90] C.-C., Jou and S.A., Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J.C.M., Baeten and J.W., Klop, editors, CONCUR 90 First International Conference on Concurrency Theory, number 458 in Lecture Notes in Computer Science. Springer-Verlag, 1990.
[Koz06] D., Kozen. Coinductive proof principles for stochastic processes. In R., Alur, editor, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science LICS'06, pages 359–366, August 2006.
[Koz07] D., Kozen. Coinductive proof principles for stochastic processes. Logical Methods in Computer Science, 3(4:8):1–14, 2007.Google Scholar
[KS60] J.G., Kemeny and J.L., Snell. Finite Markov Chains. Van Nostrand, 1960.
[KT66] J.F.C., Kingman and S.J., Taylor. Introduction to Measure and Probability. Cambridge University Press, 1966.
[LS91] K.G., Larsen and A., Skou. Bisimulation through probablistic testing. Information and Computation, 94:1–28, 1991.Google Scholar
[Pan01] P., Panangaden. Measure and probability for concurrency theorists. Theoretical Computer Science, 253(2):287–309, 2001.Google Scholar
[Pan09] P., Panangaden. Labelled Markov Processes. Imperial College Press, 2009.
[PLS00] A., Philippou, I., Lee, and O., Sokolsky. Weak bisimulation for probabilistic processes. In C., Palamidessi, editor, Proceedings of CONCUR 2000, number 1877 in Lecture Notes in Computer Science, pages 334–349. Springer-Verlag, 2000.
[Pop94] S., Popkorn. First Steps in Modal Logic. Cambridge University Press, 1994.
[Rut95] J.J.M.M., Rutten. <Ct>A calculus of transition systems (towards universal coalgebra). In A., Ponse, M., Rijke, and Y., Venema, editors, Modal Logic and Process Algebra, A Bisimulation Perspective, number 53 in CSLI Lecture Notes, 1995. Available electronically from www.cwi.nl/~janr.
[Rut98] J.J.M.M., Rutten. Relators and metric bisimulations. In Proceedings of Coalgebraic Methods in Computer Science, volume 11 of ENTCS, 1998.
[Seg06] R., Segala. Probability and nondeterminism in operational models of concurrency. In Proceedings of the 17th International Conference on Concurrency Theory CONCUR '06, number 4137 in Lecture Notes in Computer Science, pages 64–78, 2006.
[SL94] R., Segala and N., Lynch. Probabilistic simulations for probabilistic processes. In B., Jonsson and J., Parrow, editors, Proceedings of CONCUR94, number 836 in Lecture Notes in Computer Science, pages 481–496. Springer-Verlag, 1994.
[SL95] R., Segala and N., Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.Google Scholar
[Sri98] S.M., Srivastava. A Course on Borel Sets. Number 180 in Graduate Texts in Mathematics. Springer-Verlag, 1998.
[ST05] R., Segala and A., Turrini. Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In Proceedings of the Second International Conference on the Quantitative Evaluation of Systems (QEST), pages 44–53. IEEE Press, September 2005.
[vBW01a] F., Breugel and J., Worrell. An algorithm for quantitative verification of probabilistic systems. In K.G., Larsen and M., Nielsen, editors, Proceedings of the Twelfth International Conference on Concurrency Theory – CONCUR'01, number 2154 in Lecture Notes in Computer Science, pages 336–350. Springer-Verlag, 2001.
[vBW01b] F., Breugel and J., Worrell. Towards quantitative verification of probabilistic systems. In Proceedings of the Twenty-eighth International Colloquium on Automata, Languages and Programming. Springer-Verlag, 2001.
[vGSST90] R., Glabbeek, S., Smolka, B., Steffen, and C., Tofts. Reactive generative and stratified models for probabilistic processes. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, 1990.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×