Probabilistic Bisimulation - Semantics of Probabilistic Processes: An Operational Approach - page 68

75. van Glabbeek, R.: The linear time-branching time spectrum I; the semantics of concrete,
sequential processes. Handbook of Process Algebra, Chapter 1, pp. 3-99. Elsevier (2001)
76. van Breugel, F., Worrell, J.: Approximating and computing behavioural distances in
probabilistic transition systems. Theor. Comput Sci. 360 (1-3), 373-385 (2006)
77. van Breugel, F., Sharma, B., Worrell, J.: Approximating a behavioural pseudometric with-
out discount for probabilistic systems. Proceedings of the 10th International Conference on
Foundations of Software Science and Computational Structures. Lecture Notes in Computer
Science, vol. 4423, pp. 123-137. Springer, Heidelberg (2007)
78. van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems.
Theor. Comput. Sci. 331 (1), 115-142 (2005)
79. van Breugel, F., Hermida, C., Makkai, M., Worrell, J.: An accessible approach to behavioural
pseudometrics. Proceedings of the 32nd International Colloquium on Automata, Languages
and Programming. Lecture Notes in Computer Science, vol. 3580, pp. 1018-1030. Springer,
Heidelberg (2005)
80. van Breugel, F., Hermida, C., Makkai, M., Worrell, J.: Recursively defined metric spaces
without contraction. Theor. Comput. Sci. 380 (1-2), 143-163 (2007)
81. Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Metrics for labeled Markov systems.
Proceedings of the 10th International Conference on Concurrency Theory. Lecture Notes in
Computer Science, vol. 1664, pp. 258-273. Springer-Verlag, Heidelberg (1999)
82. Ferns, N., Panangaden, P., Precup, D.: Metrics for finite Markov decision processes. Proceed-
ings of the 20th Conference in Uncertainty in Artificial Intelligence, pp. 162-169. AUAI Press
(2004)
83. Ferns, N., Panangaden, P., Precup, D.: Metrics for Markov decision processes with infinite state
spaces. Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence, pp. 201-
208. AUAI Press (2005)
84. Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for action-labelled quantitative
transition systems. Electron. Notes Theor. Comput. Sci. 153 (2), 79-96 (2006)
85. Chatzikokolakis, K., Gebler, D., Palamidessi, C., Xu, L.: Generalized bisimulation metrics.
Proceedings of the 25th International Conference on Concurrency Theory. Lecture Notes in
Computer Science, vol. 8704, pp. 32-46. Springer, Heidelberg (2014)
86. Ying, M.: Bisimulation indexes and their applications. Theor. Comput. Sci. 275 , 1-68 (2002)
87. Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: Efficient decision
algorithms for probabilistic simulations. Log. Methods Comput. Sci. 4 (4:6) (2008)
88. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and
applications. SIAM J. Comput. 18 (1), 30-55 (1989)
89. Crafa, S., Ranzato, F.: Bisimulation and simulation algorithms on probabilistic transition
systems by abstract interpretation. Form. Methods Syst. Des. 40 (3), 356-376 (2012)
90. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of pro-
grams by construction or approximation of fixpoints. Proceedings of the 4th ACM Symposium
on Principles of Programming Languages, pp. 238-252. ACM (1977)
91. Panangaden, P.: Labelled Markov Processes. Imperial College Press, London (2009)