APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS

Journal article

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. © Springer-Verlag Berlin Heidelberg 2007.

Authors: Van Breugel, F; Sharma, B; Worrell, J

• Publication status: Published
• Journal: LOGICAL METHODS IN COMPUTER SCIENCE
• Volume: 4
• Issue: 2
• Pages: 123-137
• Publication date: 2008-01-01
• DOI: 10.2168/LMCS-4(2:2)2008
• EISSN: 1611-3349
• ISSN: 1860-5974
• Language: English
• Keywords: probabilistic bisimilarity; probabilistic transition system; approximation algorithm; behavioural pseudometric