G. Bacci, G. Bacci, K. G. Larsen, and R. Mardare, Computing Behavioral Distances, Compositionally, Proc. MFCS'13, pp.74-85, 2013.
DOI : 10.1007/978-3-642-40313-2_9

G. Bacci, G. Bacci, K. G. Larsen, and R. Mardare, On-the-Fly Exact Computation of Bisimilarity Distances, TACAS. LNCS, pp.1-15, 2013.
DOI : 10.1007/978-3-642-36742-7_1

G. Barthe, B. Köpf, F. Olmedo, and S. Z. Béguelin, Probabilistic relational reasoning for differential privacy, Proc. of POPL, 2012.

F. Van-breugel and J. Worrell, An Algorithm for Quantitative Verification of Probabilistic Transition Systems, Proc. of CONCUR'01, pp.336-350, 2001.
DOI : 10.1007/3-540-44685-0_23

F. Van-breugel and J. Worrell, Towards Quantitative Verification of Probabilistic Transition Systems, Proc. of ICALP, pp.421-432, 2001.
DOI : 10.1007/3-540-48224-5_35

F. Van-breugel and J. Worrell, A behavioural pseudometric for probabilistic transition systems, Theoretical Computer Science, vol.331, issue.1, pp.115-142, 2005.
DOI : 10.1016/j.tcs.2004.09.035

F. Van-breugel and J. Worrell, Approximating and computing behavioural distances in probabilistic transition systems, Theoretical Computer Science, vol.360, issue.1-3, pp.373-385, 2006.
DOI : 10.1016/j.tcs.2006.05.021

F. Van-breugel and J. Worrell, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, Horizons of the Mind, pp.191-213, 2014.
DOI : 10.1007/BFb0030814

X. Cai and Y. Gu, Measuring Anonymity, pp.183-194, 2009.
DOI : 10.1007/3-540-36467-6_9

K. Chatterjee, L. De-alfaro, R. Majumdar, and V. Raman, Algorithms for Game Metrics, Logical Methods in Computer Science, vol.6, issue.3, pp.107-118, 2008.
DOI : 10.2168/LMCS-6(3:13)2010

K. Chatzikokolakis, M. E. Andrés, N. E. Bordenabe, and C. Palamidessi, Broadening the Scope of Differential Privacy Using Metrics, Proc. of PETS. LNCS, pp.82-102, 2013.
DOI : 10.1007/978-3-642-39077-7_5
URL : https://hal.archives-ouvertes.fr/hal-00767210

K. Chatzikokolakis, D. Gebler, C. Palamidessi, and L. Xu, Generalized Bisimulation Metrics, Tech. rep. INRIA, 2014.
DOI : 10.1007/978-3-662-44584-6_4
URL : https://hal.archives-ouvertes.fr/hal-01011471

D. Chen, F. Van-breugel, and J. Worrell, On the Complexity of Computing Probabilistic Bisimilarity, FOSSACS. LNCS, pp.437-451, 2012.
DOI : 10.1007/978-3-642-28729-9_29

S. Cheng, A crash course on the lebesgue integral and measure theory, 2008.

G. Comanici and D. Precup, Basis Function Discovery Using Spectral Clustering and Bisimulation Metrics, AAAI, pp.85-99, 2012.
DOI : 10.1007/978-3-642-28499-1_6

D. 'argenio, P. R. Gebler, D. Lee, and M. D. , Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules, Proc. FoSSaCS'14, pp.289-303, 2014.

Y. Deng and W. Du, The Kantorovich Metric in Computer Science: A Brief Survey, Electronic Notes in Theoretical Computer Science, vol.253, issue.3, pp.73-82, 2009.
DOI : 10.1016/j.entcs.2009.10.006

Y. Deng, C. Palamidessi, and J. Pang, Weak Probabilistic Anonymity, Proc. of SecCo. ENTCS, pp.55-76, 2007.
DOI : 10.1016/j.entcs.2005.05.047
URL : https://hal.archives-ouvertes.fr/hal-00159688

J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden, Metrics for Labeled Markov Systems, Proc. of CONCUR, pp.258-273, 1999.
DOI : 10.1007/3-540-48320-9_19

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.413-422, 2002.
DOI : 10.1109/LICS.2002.1029849

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, Metrics for labelled Markov processes, Theoretical Computer Science, vol.318, issue.3, pp.323-354, 2004.
DOI : 10.1016/j.tcs.2003.09.013

C. Dwork, Differential Privacy, Proc. of ICALP, pp.1-12, 2006.
DOI : 10.1007/11787006_1

C. Dwork, K. Kenthapadi, F. Mcsherry, I. Mironov, and M. Naor, Our Data, Ourselves: Privacy Via Distributed Noise Generation, EUROCRYPT, pp.486-503, 2006.
DOI : 10.1007/11761679_29

N. Ferns, P. Panangaden, and D. Precup, Metrics for markov decision processes with infinite state spaces, Proc. of UAI, pp.201-208, 2005.

N. Ferns, P. Panangaden, and D. Precup, Bisimulation Metrics for Continuous Markov Decision Processes, SIAM Journal on Computing, vol.40, issue.6, pp.1662-1714, 2011.
DOI : 10.1137/10080484X

M. D. Lee, D. Gebler, and P. R. D-'argenio, Tree rules in probabilistic transition system specifications with negative and quantitative premises, Proc. EX- PRESS/SOS'12. EPTCS, pp.115-130, 2012.
DOI : 10.4204/EPTCS.89.9

T. Norfolk, When does a metric generate convex balls? Tech. rep, 1991.

J. Reed and B. C. Pierce, Distance makes the types grow stronger: a calculus for differential privacy, Proc. of ICFP, pp.157-168, 2010.

A. Smith, Efficient, differentially private point estimators. arXiv preprint arXiv:0809, p.4794, 2008.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

D. Thorsley and E. Klavins, Approximating stochastic biochemical processes with Wasserstein pseudometrics, IET Systems Biology, vol.4, issue.3, pp.193-211, 2010.
DOI : 10.1049/iet-syb.2009.0039

M. C. Tschantz, D. Kaynar, and A. Datta, Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract), Electronic Notes in Theoretical Computer Science, vol.276, pp.61-79, 2011.
DOI : 10.1016/j.entcs.2011.09.015

L. Xu, K. Chatzikokolakis, and H. Lin, Metrics for Differential Privacy in Concurrent Systems, Proc. of FORTE, pp.199-215, 2014.
DOI : 10.1007/978-3-662-43613-4_13
URL : https://hal.archives-ouvertes.fr/hal-00879140