A behavioural pseudometric for metric labelled transition systems

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 141-155

  Van Breugel, Franck ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; METRIC SYSTEM; NUMBER THEORY; STATE ASSIGNMENT; TIME SHARING SYSTEMS;

BEHAVIOURAL PSEUDOMETRIC; METRIC LABELED TRANSITION SYSTEMS; NONNEGATIVE REAL NUMBER; TIMED TRANSITION SYSTEMS;

CONCURRENCY CONTROL;

EID: 27244457559     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_14     Document Type: Conference Paper

References (30)

1. P. Aczel and N. Mendier. A final coalgebra theorem. In Proceedings of CTCS, volume 389 of LNCS, pages 357-365, 1989. Springer-Verlag.
2. M.A. Arbib and E.G. Manes. Arrows, Structures, and Functors: the categorical imperative, Academic Press, 1975.
3. M. Barr. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 114(2):299-315, 1993.
4. F. van Breugel. A behavioural pseudometric for metric labelled transition systems. Technical Report CS-2005-11, York University, 2005.
5. F. van Breugel, C. Hermida, M. Makkai, and J. Worrell. An accessible approach to behavioural pseudometrics. In Proceedings of ICALP, volume 3580 of LNCS, pages 1018-1030, 2005. Springer-Verlag.
6. F. van Breugel and J. Worrell. An algorithm for quantitative verification of probabilistic transition systems. In Proceedings of CONCUR, volume 2154 of LNCS, pages 336-350, 2001. Springer-Verlag.
7. 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-Verlag.
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. 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.
17. A. Girard and G.J. Pappas. Approximation metrics for discrete and continuous systems. Technical Report MS-CIS-05-10, University of Pennsylvania, 2005.
18. V. Gupta, R. Jagadeesan, and P. Panangaden. Approximate reasoning for real-time probabilistic processes. In Proceedings of QEST, pages 304-313, 2004. IEEE.
19. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, 1985.
20. B. Jacobs and J.J.M.M. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62:222-259, 1997.
21. M. Makkai and R. Pare. Accessible Categories: The Foundation of Categorical Model Theory, American Mathematical Society, 1989.
22. R. Milner. Communication and Concurrency, Prentice Hall International, 1989.
23. R. Milner. David Michael Ritchie Park (1935-1990) in memoriam. Theoretical Computer Science, 133(2):187-200, 1994.
24. D. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th GI-Conference on Theoretical Computer Science, volume 104 of LNCS, pages 167-183, 1981. Springer-Verlag.
25. D. Sangiorgi. Bisimulation: from the origins to today. In Proceedings of LICS, pages 298-302. IEEE, 2004.
26. M.B. Smyth. Topology. In Handbook of Logic in Computer Science, volume 1, pages 641-761. Oxford University Press, 1992.
27. B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149-163, 1994.
28. G. Winskel and M. Nielsen. Models for concurrency. In Handbook of Logic in Computer Science, volume 4, pages 1-148. Oxford University Press, 1995.
29. M. Ying. Bisimulation indexes and their applications. Theoretical Computer Science, 275(1/2):1-68, 2002.
30. M. Ying and M. Wirsing. Approximate bisimilarity. In Proceedings of AMAST, volume 1816 of LNCS, pages 309-322, 2000. Springer-Verlag.