A behavioural pseudometric for probabilistic transition systems

Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper, we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Borel probability measures on a metric space. States of a probabilistic transition system have distance 0 if and only if they are probabilistic bisimilar. We also characterize our distance function in terms of a real-valued modal logic.

[1]  Vincent Danos,et al.  Labelled Markov Processes: Stronger and Faster Approximations , 2004, Electron. Notes Theor. Comput. Sci..

[2]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[3]  G. A. Edgar.  Integral, probability, and fractal measures , 1997 .

[4]  den Jeremy Ian Hartog,et al.  Probabilistic Extensions of Semantical Models , 2002 .

[5]  Jan Rutten,et al.  On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces , 1998, Mathematical Structures in Computer Science.

[6]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[7]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[8]  K. Parthasarathy,et al.  Probability measures on metric spaces , 1967 .

[9]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[10]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[11]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[12]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[13]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[14]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[15]  Marta Z. Kwiatkowska,et al.  A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes , 1997, COMPROX.

[16]  Radha Jagadeesan,et al.  Approximating labeled Markov processes , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[17]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[18]  Christel Baier,et al.  Domain equations for probabilistic processes , 2000, Mathematical Structures in Computer Science.

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

[20]  R. Ash,et al.  Real analysis and probability , 1975 .

[21]  Paolo Baldan,et al.  A Fixed-Point Theorem in a Category of Compact Metric Spaces , 1995, Theor. Comput. Sci..

[22]  Jim Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .

[23]  Pierre America,et al.  Solving Reflexive Domain Equations in a Category of Complete Metric Spaces , 1987, J. Comput. Syst. Sci..

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

[25]  Radha Jagadeesan,et al.  Metrics for Labeled Markov Systems , 1999, CONCUR.

[26]  Marta Z. Kwiatkowska,et al.  Probabilistic Metric Semantics for a Simple Language with Recursion , 1996, MFCS.

[27]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[28]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[29]  S. Lane.  Categories for the Working Mathematician , 1971 .

[30]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[31]  Wilson A. Sutherland,et al.  Introduction to Metric and Topological Spaces , 1975 .