Testing Labelled Markov Processes
Larsen and Skou introduced a notion of bisimulation for probabilistic transition systems. They characterized probabilistic bisimilarity in terms of a probabilistic modal logic and also in terms of ‘button pressing’ tests. Desharnais et al. extended the notion of probabilistic bisimulation and the logical characterization of probabilistic bisimilarity to labelled Markov processes. These processes generalize probabilistic transition systems in that they also allow continuous state spaces. We extend the characterization of probabilistic bisimilarity in terms of testing to labelled Markov processes. One of our main technical contributions is the construction of a final object in a category of labelled Markov processes and the identification of a natural metric on the state space of the final labelled Markov process. This metric provides us with another characterization of probabilistic bisimilarity: states are probabilistic bisimilar if and only if they have distance 0.
Unable to display preview. Download preview PDF.
- 2.J. Adámek and V. Koubek. Least fixed point of a functor. Journal of Computer System Sciences, 19(2):163–178, October 1979.Google Scholar
- 3.P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences, 39(3):343–375, December 1989.Google Scholar
- 7.B. Bloom and A. Meyer. Experimenting with process equivalence. Theoretical Computer Science, 101(2):223–237, July 1992.Google Scholar
- 8.R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 149–158, Warsaw, June/July 1997. IEEE.Google Scholar
- 9.F. van Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In F. Orejas, P.G. Spirakis, and J. van Leeuwen, editors, Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 421–432, Crete, July 2001. Springer-Verlag.CrossRefGoogle Scholar
- 10.F. van Breugel and J. Worrell. An algorithm for quantitative verification of probabilistic transition systems. In K.G. Larsen and M. Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 336–350, Aalborg, August 2001. Springer-Verlag.Google Scholar
- 11.F. van Breugel and J. Worrell. A behavioural pseudometric for probabilistic transition systems. Available at http://www.cs.yorku.ca/~franck, October 2001.
- 12.J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labeled Markov processes. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 478–487, Indianapolis, June 1998. IEEE.Google Scholar
- 13.J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. To appear in Information and Computation. Available at http://www-acaps.cs.mcgill.ca/~prakash, 1999.
- 14.J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In J.C.M. Baeten and S. Mauw, editors, Proceedings of the 10th International Conference on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 258–273, Eindhoven, August 1999. Springer-Verlag.Google Scholar
- 15.J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. Available at http://www-acaps.cs.mcgill.ca/~prakash, November 2001.
- 17.M. Giry. A categorical approach to probability theory. In B. Banaschewski, editor, Proceedings of the International Conference on Categorical Aspects of Topology and Analysis, volume 915 of Lecture Notes in Mathematics, pages 68–85, Ottawa, August 1981. Springer-Verlag.Google Scholar
- 18.M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.Google Scholar
- 19.K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, September 1991.Google Scholar
- 21.D. Turi and J.J.M.M. Rutten. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. Mathematical Structures in Computer Science, 8(5):481–540, October 1998.Google Scholar