An accessible approach to behavioural pseudometrics with an application to probabilistic systems

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1018-1030

  Van Breugel, Franck ^a   Hermida, Claudio ^b   Makkai, Michael ^c   Worrell, James ^d  

^a YORK UNIVERSITY   (Canada)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^c MCGILL UNIVERSITY   (Canada)

^d Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; MATHEMATICAL MODELS; PROBABILITY;

PROBABILISTIC SYSTEMS; QUANTITATIVE DATA;

COMPUTER SCIENCE;

EID: 26444441410     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_82     Document Type: Conference Paper

References (27)

1. J. Adámek and J. Rosický. Locally Presentable and Accessible Categories, Cambridge University Press, 1994.
2. M.A. Arbib and E.G. Manes. Arrows, Structures, and Functors: the categorical imperative, Academic Press, 1975.
3. J.W. de Bakker and E.P. de Vink. Control Flow Semantics, The MIT Press, 1996.
4. M. Barr. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 114(2):299-315, 1993.
5. P. Billingsley. Probability and Measure, John Wiley & Sons, 1995.
6. F. van Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In Proceedings of ICALP, volume 2076 of LNCS, pages 421-432, 2001. Springer-Ver lag.
7. F. van Breugel and J. Worrell. A behavioural pseudometric for metric labelled transition systems. 2005.
8. F. van Breugel and J. Worrell. A behavioural pseudometric for probabilistic transition systems. Theoretical Computer Science, 331(1):115-142, 2005.
9. L. de Alfaro. Quantitative verification and control via the mu-calculus. In Proceedings of CONCUR, volume 2761 of LNCS, pages 102-126, 2003. Springer-Verlag.
10. L. de Alfaro, M. Faella, and M. Stoelinga. Linear and branching metrics for quantitative transition systems. In Proceedings of ICALP, volume 3142 of LNCS, pages 97-109, 2004. Springer-Verlag.
11. L. de Alfaro, T.A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In Proceedings of ICALP, volume 2719 of LNCS, pages 1022-1037, 2003. Springer-Verlag.
12. Y. Deng, T. Chothia, C. Palamidessi, and J. Pang. Metrics for action-labelled quantitative transition systems. In Proceedings of QAPL, ENTCS, 2005. Elsevier.
13. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In Proceedings of CONCUR, volume 1664 of LNCS, pages 258-273, 1999. Springer-Verlag.
14. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Proceedings of LICS, pages 413-422, 2002. IEEE.
15. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labelled Markov processes. Theoretical Computer Science, 318(3):323-354, 2004.
16. G.A. Edgar. Integral, Probability, and Fractal Measures, Springer-Verlag, 1998.
17. R. Engelking. General Topology, Heldermann Verlag, 1989.
18. A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of PROCOMET, pages 443-458, 1990. North-Holland.
19. V. Gupta, R. Jagadeesan, and P. Panangaden. Approximate reasoning for real-time probabilistic processes. In Proceedings of QEST, pages 304-313, 2004. IEEE.
20. R. Heckmann. Probabilistic domains. In Proceedings of CAAP, volume 787 of LNCS, pages 142-156, 1994. Springer-Verlag.
21. B. Jacobs and J.J.M.M. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62:222-259, 1997.
22. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
23. S. Mac Lane. Categories for the Working Mathematician, Springer-Verlag, 1971.
24. M. Makkai and R. Paré. Accessible Categories: The Foundation of Categorical Model Theory, American Mathematical Society, 1989.
25. K.R. Parthasarathy. Probability Measures on Metric Spaces, Academic Press, 1967.
26. D. Turi and J.J.M.M. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481-540, 1998.
27. E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221(1/2):271-293, 1999.