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

26. Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for
probabilistic processes. J. Comput. Syst. Sci. 60 (1), 187-231 (2000)
27. Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)
28. Park, D.: Concurrency and automata on infinite sequences. Proceedings of the 5th GI-
Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 104,
pp. 167-183. Springer, Heidelberg (1981)
29. Pnueli, A.: Linear and branching structures in the semantics and logics of reactive systems.
Proceedings of the 12th International Colloquium on Automata, Languages and Programming.
Lecture Notes in Computer Science, vol. 194, pp. 15-32. Springer, Heidelberg (1985)
30. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. the ACM
32 (1), 137-161 (1985)
31. Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci. 27 , 333-354 (1983)
32. Monge, G.: Mémoire sur la théorie des déblais et des remblais. Histoire de l'Academie des
Science de Paris p. 666 (1781)
33. Vershik, A.: Kantorovich metric: Initial history and little-known applications. J. Math. Sci.
133 (4), 1410-1417 (2006)
34. Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Proceedings of the
20th ACM Symposium on the Theory of Computing, pp. 377-387. ACM (1988)
35. Deng, Y., Du, W.: Kantorovich metric in computer science: A brief survey. Electron. Notes
Theor. Comput. Sci. 353 (3), 73-82 (2009)
36. Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. Int. Stat. Rev. 70 (3),
419-435 (2002)
37. Rachev, S.: Probability Metrics and the Stability of Stochastic Models. Wiley, NewYork (1991)
38. Kantorovich, L.V., Rubinshtein, G.S.: On a space of totally additive functions. Vestn Len. Univ.
13 (7), 52-59 (1958)
39. Villani, C.: Topics in Optimal Transportation, Graduate Studies in Mathematics, vol. 58.
American Mathematical Society (2003)
40. van Breugel, F., Worrell, J.: An algorithm for quantitative verification of probabilistic transition
systems. Proceedings of the 12th International Conference on Concurrency Theory. Lecture
Notes in Computer Science, vol. 2154, pp. 336-350. Springer, Heidelberg (2001)
41. Even, S.: Graph Algorithms. Computer Science Press, Potomac (1979)
42. Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (2010)
43. Aharonia, R., Bergerb, E., Georgakopoulosc, A., Perlsteina, A., Sprüssel, P.: The max-flow
min-cut theorem for countable networks. J. Comb. Theory, Ser. B 101 (1), 1-17 (2011)
44. Sack, J., Zhang, L.: A general framework for probabilistic characterizing formulae. Proceedings
of the 13th International Conference on Verification, Model Checking, and Abstract Interpre-
tation. Lecture Notes in Computer Science, vol. 7148, pp. 396-411. Springer, Heidelberg
(2012)
45. Hermanns, H., Parma, A. et al.: Probabilistic logical characterization. Inf. Comput. 209 (2),
154-172 (2011)
46. Desharnais, J., Edalat, A., Panangaden, P.: A logical characterization of bisimulation for
labelled Markov processes. Proceedings of the 13th Annual IEEE Symposium on Logic in
Computer Science, pp. 478-489. IEEE Computer Society Press (1998)
47. Parma, A., Segala, R.: Logical characterizations of bisimulations for discrete probabilistic
systems. Proceedings of the 10th International Conference on Foundations of Software Science
and Computational Structures. Lecture Notes in Computer Science, vol. 4423, pp. 287-301.
Springer, Heidelberg (2007)
48. van Breugel, F., Mislove, M., Ouaknine, J., Worrell, J.: Domain theory, testing and simulation
for labelled Markov processes. Theor. Comput. Sci. 333 (1-2), 171-197 (2005)
49. Sangiorgi, D., Rutten, J. (eds.): Advanced Topics in Bisimulation and Coinduction. Cambridge
University Press, New York (2011)
50. Doberkat, E.E.: Stochastic Coalgebraic Logic. Springer, Heidelberg (2010)
51. Deng, Y., Wu, H.: Modal Characterisations of Probabilistic and Fuzzy Bisimulations. Proceed-
ings of the 16th International Conference on Formal Engineering Methods. Lecture Notes in
Computer Science, vol. 8829, pp. 123-138. Springer, Heidelberg (2014)