{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:49:30Z","timestamp":1764841770548,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445839"},{"type":"electronic","value":"9783662445846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_4","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"32-46","source":"Crossref","is-referenced-by-count":20,"title":["Generalized Bisimulation Metrics"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gebler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-40313-2_9","volume-title":"Mathematical Foundations of Computer Science 2013","author":"G. Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Computing Behavioral Distances, Compositionally. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol.\u00a08087, pp. 74\u201385. Springer, Heidelberg (2013)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On-the-fly exact computation of bisimilarity distances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 1\u201315. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_1"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., B\u00e9guelin, S.Z.: Probabilistic relational reasoning for differential privacy. In: Proc. of POPL. ACM (2012)","DOI":"10.1145\/2103656.2103670"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44685-0_23","volume-title":"CONCUR 2001 - Concurrency Theory","author":"F. Breugel van","year":"2001","unstructured":"van Breugel, F., Worrell, J.B.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 336\u2013350. Springer, Heidelberg (2001)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-48224-5_35","volume-title":"Automata, Languages and Programming","author":"F. Breugel van","year":"2001","unstructured":"van Breugel, F., Worrell, J.B.: Towards quantitative verification of probabilistic transition systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 421\u2013432. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","volume":"331","author":"F. Breugel van","year":"2005","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theor. Comp. Sci.\u00a0331(1), 115\u2013142 (2005)","journal-title":"Theor. Comp. Sci."},{"issue":"1-3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2006.05.021","volume":"360","author":"F. Breugel van","year":"2006","unstructured":"van Breugel, F., Worrell, J.: Approximating and computing behavioural distances in probabilistic transition systems. Theor. Comp. Sci.\u00a0360(1-3), 373\u2013385 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-00843-6_17","volume-title":"Information Security Practice and Experience","author":"X. Cai","year":"2009","unstructured":"Cai, X., Gu, Y.: Measuring anonymity. In: Bao, F., Li, H., Wang, G. (eds.) ISPEC 2009. LNCS, vol.\u00a05451, pp. 183\u2013194. Springer, Heidelberg (2009)"},{"key":"4_CR9","unstructured":"Chatterjee, K., de Alfaro, L., Majumdar, R., Raman, V.: Algorithms for Game Metrics. In: FSTTCS, vol.\u00a02, pp. 107\u2013118. Leibniz-Zentrum fuer Informatik (2008)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-39077-7_5","volume-title":"Privacy Enhancing Technologies","author":"K. Chatzikokolakis","year":"2013","unstructured":"Chatzikokolakis, K., Andr\u00e9s, M.E., Bordenabe, N.E., Palamidessi, C.: Broadening the scope of Differential Privacy using metrics. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol.\u00a07981, pp. 82\u2013102. Springer, Heidelberg (2013)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Gebler, D., Palamidessi, C., Xu, L.: Generalized bisimulation metrics. Tech. rep., INRIA (2014)","DOI":"10.1007\/978-3-662-44584-6_4"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28729-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Chen","year":"2012","unstructured":"Chen, D., van Breugel, F., Worrell, J.: On the complexity of computing probabilistic bisimilarity. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 437\u2013451. Springer, Heidelberg (2012)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-28499-1_6","volume-title":"Adaptive and Learning Agents","author":"G. Comanici","year":"2012","unstructured":"Comanici, G., Precup, D.: Basis function discovery using spectral clustering and bisimulation metrics. In: Vrancx, P., Knudson, M., Grze\u015b, M. (eds.) ALA 2011. LNCS, vol.\u00a07113, pp. 85\u201399. Springer, Heidelberg (2012)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"D\u2019Argenio, P.R., Gebler, D., Lee, M.D.: Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 289\u2013303. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54830-7_19"},{"issue":"3","key":"4_CR15","first-page":"73","volume":"253","author":"Y. Deng","year":"2009","unstructured":"Deng, Y., Du, W.: The kantorovich metric in computer science: A brief survey. ENTCS\u00a0253(3), 73\u201382 (2009)","journal-title":"ENTCS"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: Proc. of SecCo. ENTCS, vol.\u00a0180 (1), pp. 55\u201376. Elsevier (2007)","DOI":"10.1016\/j.entcs.2005.05.047"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. of LICS, pp. 413\u2013422. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comp. Sci.\u00a0318(3), 323\u2013354 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: Privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Lee, M.D., Gebler, D., D\u2019Argenio, P.R.: Tree Rules in Probabilistic Transition System Specifications with Negative and Quantitative Premises. In: Proc.\u00a0EXPRESS\/SOS 2012. EPTCS, vol.\u00a089, pp. 115\u2013130 (2012)","DOI":"10.4204\/EPTCS.89.9"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: A calculus for differential privacy. In: Proc. of ICFP, pp. 157\u2013168. ACM (2010)","DOI":"10.1145\/1932681.1863568"},{"key":"4_CR23","unstructured":"Smith, A.: Efficient, differentially private point estimators. arXiv preprint arXiv:0809.4794 (2008)"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1049\/iet-syb.2009.0039","volume":"4","author":"D. Thorsley","year":"2010","unstructured":"Thorsley, D., Klavins, E.: Approximating stochastic biochemical processes with wasserstein pseudometrics. Systems Biology, IET\u00a04(3), 193\u2013211 (2010)","journal-title":"Systems Biology, IET"},{"key":"4_CR26","first-page":"61","volume":"276","author":"M.C. Tschantz","year":"2011","unstructured":"Tschantz, M.C., Kaynar, D., Datta, A.: Formal verification of differential privacy for interactive systems (extended abstract). ENTCS\u00a0276, 61\u201379 (2011)","journal-title":"ENTCS"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-43613-4_13","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L. Xu","year":"2014","unstructured":"Xu, L., Chatzikokolakis, K., Lin, H.: Metrics for differential privacy in concurrent systems. In: \u00c1brah\u00e1m, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol.\u00a08461, pp. 199\u2013215. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:59Z","timestamp":1746351659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}