Testing Labelled Markov Processes
 Franck van Breugel,
 Steven Shalit,
 James Worrell
 … show all 3 hide
Abstract
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.
 S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53(2/3):225–242, 1987. CrossRef
 J. Adámek and V. Koubek. Least fixed point of a functor. Journal of Computer System Sciences, 19(2):163–178, October 1979.
 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.
 W. Arveson. An Invitation to C ^{*}Algebras. SpringerVerlag, New York, 1976.
 M.F. Barnsley. Fractals Everywhere. Academic Press, Boston, second edition, 1993.
 P. Billingsley. Probability and Measure. Wiley, New York, third edition, 1995.
 B. Bloom and A. Meyer. Experimenting with process equivalence. Theoretical Computer Science, 101(2):223–237, July 1992.
 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.
 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. SpringerVerlag. CrossRef
 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. SpringerVerlag.
 F. van Breugel and J. Worrell. A behavioural pseudometric for probabilistic transition systems. Available at http://www.cs.yorku.ca/~franck, October 2001.
 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.
 J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. To appear in Information and Computation. Available at http://wwwacaps.cs.mcgill.ca/~prakash, 1999.
 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. SpringerVerlag.
 J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. Available at http://wwwacaps.cs.mcgill.ca/~prakash, November 2001.
 G.A. Edgar. Integral, Probability, and Fractal Measures. SpringerVerlag, New York, 1998.
 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. SpringerVerlag.
 M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.
 K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, September 1991.
 K.R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, New York, 1967.
 D. Turi and J.J.M.M. Rutten. On the foundations of final semantics: nonstandard sets, metric spaces, partial orders. Mathematical Structures in Computer Science, 8(5):481–540, October 1998.
 Title
 Testing Labelled Markov Processes
 Book Title
 Automata, Languages and Programming
 Book Subtitle
 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings
 Pages
 pp 537548
 Copyright
 2002
 DOI
 10.1007/3540454659_46
 Print ISBN
 9783540438649
 Online ISBN
 9783540454656
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 2380
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Peter Widmayer ^{(4)}
 Stephan Eidenbenz ^{(4)}
 Francisco Triguero ^{(5)}
 Rafael Morales ^{(5)}
 Ricardo Conejo ^{(5)}
 Matthew Hennessy ^{(6)}
 Editor Affiliations

 4. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich
 5. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga
 6. School of Cognitive and Computing Sciences, University of Sussex
 Authors

 Franck van Breugel ^{(7)}
 Steven Shalit ^{(8)}
 James Worrell ^{(8)}
 Author Affiliations

 7. Department of Computer Science, York University, 4700 Keele Street, Toronto, M3J 1P3, Canada
 8. Department of Mathematics, Tulane University, 6823 St Charles Avenue, New Orleans, LA, 70118, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.