Approximating and computing behavioural distances in probabilistic transition systems

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 373-385

  van Breugel, Franck ^a   Worrell, James ^b  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Approximation; Behavioural pseudometric; Coalgebra; Linear programming; Probabilistic transition system

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR ALGEBRA; LINEAR PROGRAMMING;

BEHAVIOURAL PSEUDOMETRIC; COALGEBRA; POLYNOMIAL-TIME ALGORITHM; PROBABILISTIC TRANSITION SYSTEM;

PROBABILISTIC LOGICS;

EID: 33746620486     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.021     Document Type: Article

References (38)

1. America P., and Rutten J.J.M.M. Solving reflexive domain equations in a category of complete metric spaces. J. Comput. System Sci. 39 3 (1989) 343-375
2. Banach S. Sur les opérations dans les ensembles abstraits et leurs applications aux équations intégrales. Fund. Math. 3 (1922) 133-181
3. Bouchard-Cote A., Ferns N., Panangaden P., and Precup D. An approximation algorithm for labelled Markov processes towards realistic approximation. Proc. Second Internat. Conf. on the Quantitative Evaluation of Systems, Torino, September 2005 (2005), IEEE, New York
4. F. van Breugel, C. Hermida, M. Makkai, J. Worrell, An accessible approach to behavioural pseudometrics, in: L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, M. Yung (Eds.), Proc. 32nd Internat. Colloq. on Automata Languages and Programming, Lecture Notes in Computer Science, Vol. 3580, Lisbon, July 2005, Springer, Berlin, 2005, pp. 1018-1030.
5. F. van Breugel, J. Worrell, Towards quantitative verification of probabilistic transition systems, in: F. Orejas, P.G. Spirakis, J. van Leeuwen (Eds.), Proc. 28th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2076, Crete, July 2001, Springer, Berlin, 2001, pp. 421-432.
6. F. van Breugel, J. Worrell, An algorithm for quantitative verification of probabilistic transition systems, in: K.G. Larsen, M. Nielsen (Eds.), Proc. 12th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 2154, Aalborg, August 2001, Springer, Berlin, 2001, pp. 336-350.
7. van Breugel F., and Worrell J. A behavioural pseudometric for probabilistic transition systems. Theoret. Comput. Sci. 331 1 (2005) 115-142
8. Chvátal V. Linear Programming (1983), W.H. Freeman and Company, New York, San Francisco
9. L. de Alfaro, Quantitative verification and control via the mu-calculus, in: R.M. Amadio, D. Lugiez (Eds.), Proc. 14th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 2761, Marseille, September 2003, Springer, Berlin, 2003, pp. 102-126.
10. L. de Alfaro, T.A. Henzinger, R. Majumdar, Discounting the future in systems theory, in: J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), Proc. 30th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2719, Eindhoven, June/July 2003, Springer, Berlin, 2003, pp. 1022-1037.
11. Y. Deng, T. Chothia, C. Palamidessi, J. Pang, Metrics for action-labelled quantitative transition systems, in: Proc. Third Workshop on Quantitative Aspects of Programming Languages, Electronic Notes in Theoretical Computer Science, Edinburgh, April 2005, Elsevier, Amsterdam, 2005.
12. J. Desharnais, Labelled Markov processes, Ph.D. Thesis, McGill University, Montreal, November 1999.
13. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Metrics for labeled Markov systems, in: J.C.M. Baeten, S. Mauw (Eds.), Proc. 10th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 1664, Eindhoven, August 1999, Springer, Berlin, 1999, pp. 258-273.
14. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, in: Proc. 17th Annual IEEE Symp. on Logic in Computer Science, Copenhagen, July 2002, IEEE, New York, 2002, pp. 413-422.
15. Desharnais J., Gupta V., Jagadeesan R., and Panangaden P. Metrics for labeled Markov systems. Theoret. Comput. Sci. 318 3 (2004) 323-354
16. Edgar G.A. Integral, Probability, and Fractal Measures (1998), Springer, New York
17. A. Giacalone, C.-C. Jou, S.A. Smolka, Algebraic reasoning for probabilistic concurrent systems, in: Proc. IFIP WG 2.2/2.3 Working Conf. on Programming Concepts and Methods, Sea of Gallilee, April 1990, North-Holland, Amsterdam, 1990, pp. 443-458.
18. M. Giry, A categorical approach to probability theory, in: B. Banaschewski (Ed.), Proc. Internat. Conf. on Categorical Aspects of Topology and Analysis, Lecture Notes in Mathematics, Vol. 915, Ottawa, August 1981, Springer, Berlin, 1981, pp. 68-85.
19. V. Gupta, R. Jagadeesan, P. Panangaden, Approximate reasoning for real-time probabilistic processes, in: Proc. First Internat. Conf. on the Quantitative Evaluation of Systems, Enschede, September 2004, IEEE, Amsterdam, 2004, pp. 304-313.
20. Hennessy M., and Milner R. Algebraic laws for nondeterminism and concurrency. J. ACM 32 1 (1985) 137-161
21. Hutchinson J.E. Fractals and self similarity. Indiana University Mathematics Journal 30 5 (1981) 713-747
22. Jacobs B., and Rutten J. A tutorial on (co)algebras and (co)induction. Bull. EATCS 62 (1997) 222-259
23. C. Jones, G.D. Plotkin, A probabilistic powerdomain of evaluations, in: Proc. Fourth Annu. IEEE Symp. on Logic in Computer Science, Pacific Grove, California, June 1989, IEEE, Amsterdam, 1989, pp. 186-195.
24. Kantorovich L.V. On the transfer of masses. Dokl. Akad. Nauk 37 2 (1942) 227-229 (in Russian); Translated in Management Sci. 5(1) (1958) 1-4
25. Kantorovich L.V., and Rubinstein G.Sh. On the space of completely additive functions. Vestnik Leningrad. Univ. 3 2 (1958) 52-59 (in Russian)
26. Lambek J. Subequalizers. Canadian Mathematical Bulletin 13 3 (1970) 337-349
27. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Inform. Comput. 94 1 (1991) 1-28
28. McShane E.J. Extension of range of functions. Bull. Amer. Math. Soc. 40 12 (1934) 837-842
29. Milner R. A Calculus of Communicating Systems (1980), Springer, Berlin
30. J. Orlin, A faster strongly polynomial minimum cost flow algorithm, in: Proc. 20th Annu. ACM Symp. on Theory of Computing, Chicago, May 1988, ACM, New York, 1988, pp. 377-387.
31. D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. Fifth GI-Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104, Karlsruhe, March 1981, Springer, Berlin, 1981, pp. 167-183.
32. Parthasarathy K.R. Probability Measures on Metric Spaces (1967), Academic Press, New York
33. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249 1 (2000) 3-80
34. Tardos E. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 3 (1985) 247-255
35. Turi D., and Rutten J.J.M.M. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. Math. Struct. Comput. Sci. 8 5 (1998) 481-540
36. Vaserstein L. Markov processes over denumerable products of spaces, describing large systems of automata. Problems Inform. Transmission 5 3 (1969) 47-52
37. de Vink E.P., and Rutten J.J.M.M. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci. 221 1/2 (1999) 271-293
38. Whitney H. Analytic extensions of differentiable functions defined in closed sets. Trans. Amer. Math. Soc. 36 1 (1934) 63-89