Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems

Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity. Distance zero captures probabilistic bisimilarity. Each pseudometric has a discount factor, a real number in the interval (0, 1]. The smaller the discount factor, the more the future is discounted. If the discount factor is one, then the future is not discounted at all. Desharnais et al. showed that the behavioural distances can be calculated up to any desired degree of accuracy if the discount factor is smaller than one. In this paper, we show that the distances can also be approximated if the future is not discounted. A key ingredient of our algorithm is Tarski's decision procedure for the first order theory over real closed fields. By exploiting the Kantorovich-Rubinstein duality theorem we can restrict to the existential fragment for which more efficient decision procedures exist.

[1]  L. Hörmander,et al.  The Analysis of Linear Partial Differential Operators II: Differential Operators with Constant Coefficients , 1983 .

[2]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[3]  Tom Chothia,et al.  Metrics for Action-labelled Quantitative Transition Systems , 2006, QAPL.

[4]  Albert Benveniste,et al.  Toward an Approximation Theory for Computerised Control , 2002, EMSOFT.

[5]  Chris Hankin,et al.  Quantitative Relations and Approximate Process Equivalences , 2003, CONCUR.

[6]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[7]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

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

[9]  Christopher W. Brown.  An Overview of QEPCAD B: a Tool for Real Quantifier Elimination and Formula Simplification (特集 Quantifier Elimination) , 2003 .

[10]  George J. Pappas,et al.  Approximate Bisimulations for Nonlinear Dynamical Systems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[12]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[13]  Christel Baier,et al.  Deciding Bisimilarity and Similarity for Probabilistic Processes , 2000, J. Comput. Syst. Sci..

[14]  John C. Mitchell,et al.  A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols , 2005, Theor. Comput. Sci..

[15]  Luca de Alfaro,et al.  Quantitative Verification and Control via the Mu-Calculus , 2003, CONCUR.

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

[17]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[18]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

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

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

[21]  Mingsheng Ying.  Bisimulation indexes and their applications , 2002, Theor. Comput. Sci..

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

[23]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[24]  Franck van Breugel,et al.  A Behavioural Pseudometric for Metric Labelled Transition Systems , 2005, CONCUR.

[25]  M. Broucke,et al.  Regularity of solutions and homotopic equivalence for hybrid systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

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

[27]  Thomas A. Henzinger,et al.  Discounting the Future in Systems Theory , 2003, ICALP.

[28]  Babita Sharma,et al.  An Algorithm to Quantify Behavioural Similarity between Probabilistic Systems , 2006 .

[29]  Annabelle McIver,et al.  Results on the quantitative μ-calculus qMμ , 2007, TOCL.

[30]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

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