Metrics for labelled Markov processes

By Josée Desharnais, Vineet Gupta, R. Jagadeesan, Prakash Panangaden. Theoretical Computer Science, 2004

363 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Representation Discovery for MDPs Using Bisimulation Metrics (2015, background): “It was extended to MDPs with rewards by Givan et al. (2003); the metric analogue is due to Desharnais et al. (1999, 2004) and the extension of the metric to include rewards is from Ferns et al. (2004).”
Approximation Metrics for Discrete and Continuous Systems (2006, methodology): “If the equations given by Theorems 15 and 19 are difﬁcult to solve, then we can consider relaxations that will result in computing an over-approximation of the simulation or the bisimulation metrics.”
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation (2011, background): “for labelled Markov chains [17, 19] and labelled concurrent Markov chains [18]; and later on by Ferns et al.”
Bisimulation Metrics for Continuous Markov Decision Processes (2011, background): “This forms the basis for the metrics of [14, 16, 17], which are defined in terms of realvalued logical expressions.”