Computer Science – Logic in Computer Science
Scientific paper
2008-03-26
LMCS 4 (2:2) 2008
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-4(2:2)2008
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.
Breugel Franck van
Sharma Babita
Worrell James
No associations
LandOfFree
Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-50325