Generalized Bisimulation Metrics

The bisimilarity pseudometric based on the Kantorovich lifting is one of the most popular metrics for probabilistic processes proposed in the literature. However, its application in verification is limited to linear properties. We propose a generalization of this metric which allows to deal with a wider class of properties, such as those used in security and privacy. More precisely, we propose a family of metrics, parametrized on a notion of distance which depends on the property we want to verify. Furthermore, we show that the members of this family still characterize bisimilarity in terms of their kernel, and provide a bound on the corresponding metrics on traces. Finally, we study the case of a metric corresponding to differential privacy. We show that in this case it is possible to have a dual form, easier to compute, and we prove that the typical constructs of process algebra are non-expansive with respect to this metrics, thus paving the way to a modular approach to verification.

[1]  Jun Pang,et al.  Weak Probabilistic Anonymity , 2007, SecCO@CONCUR.

[2]  Kim G. Larsen,et al.  On-the-Fly Exact Computation of Bisimilarity Distances , 2013, TACAS.

[3]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[4]  E. Klavins,et al.  Approximating stochastic biochemical processes with Wasserstein pseudometrics. , 2010, IET systems biology.

[5]  Catuscia Palamidessi,et al.  Broadening the Scope of Differential Privacy Using Metrics , 2013, Privacy Enhancing Technologies.

[6]  Moni Naor,et al.  Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.

[7]  James Worrell,et al.  A behavioural pseudometric for probabilistic transition systems , 2005, Theor. Comput. Sci..

[8]  Matias David Lee,et al.  Tree rules in probabilistic transition system specifications with negative and quantitative premises , 2012, EXPRESS/SOS.

[9]  Krishnendu Chatterjee,et al.  Algorithms for Game Metrics , 2008, FSTTCS.

[10]  Xiaojuan Cai,et al.  Measuring Anonymity , 2009, ISPEC.

[11]  James Worrell,et al.  On the Complexity of Computing Probabilistic Bisimilarity , 2012, FoSSaCS.

[12]  James Worrell,et al.  An Algorithm for Quantitative Verification of Probabilistic Transition Systems , 2001, CONCUR.

[13]  Matthew E. Taylor,et al.  Adaptive and Learning Agents, Second Workshop, ALA 2009, Held as Part of the AAMAS 2009 Conference in Budapest, Hungary, May 12, 2009, Revised Selected Papers , 2010, ALA.

[14]  Dilsun Kirli Kaynar,et al.  Formal Verification of Differential Privacy for Interactive Systems , 2011, ArXiv.

[15]  Gilles Barthe,et al.  Probabilistic Relational Reasoning for Differential Privacy , 2012, TOPL.

[16]  Serge Vaudenay,et al.  Advances in Cryptology - EUROCRYPT 2006 , 2006, Lecture Notes in Computer Science.

[17]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[18]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[19]  Kim G. Larsen,et al.  Computing Behavioral Distances, Compositionally , 2013, MFCS.

[20]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[21]  James Worrell,et al.  Approximating and computing behavioural distances in probabilistic transition systems , 2006, Theor. Comput. Sci..

[22]  Doina Precup,et al.  Basis Function Discovery Using Spectral Clustering and Bisimulation Metrics , 2011, AAAI.

[23]  James Worrell,et al.  Towards Quantitative Verification of Probabilistic Transition Systems , 2001, ICALP.

[24]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[25]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[26]  Huimin Lin,et al.  Metrics for Differential Privacy in Concurrent Systems , 2014, FORTE.

[27]  Adam D. Smith,et al.  Efficient, Differentially Private Point Estimators , 2008, ArXiv.

[28]  Benjamin C. Pierce,et al.  Distance makes the types grow stronger: a calculus for differential privacy , 2010, ICFP '10.

[29]  Yuxin Deng,et al.  The Kantorovich Metric in Computer Science: A Brief Survey , 2009, QAPL.

[30]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[31]  Joost Engelfriet,et al.  Determinacy and Rewriting of Top-Down and MSO Tree Transformations , 2013, MFCS.

[32]  Matias David Lee,et al.  Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules , 2014, FoSSaCS.