2026-07-22T04:53:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1745 2024-03-06T10:33:04Z ddc:004 open_access

Algorithms for Game Metrics Chatterjee, Krishnendu de Alfaro, Luca Majumdar, Rupak Raman, Vishwanath Algorithms Metrics Kernel Simulation Bisimulation Linear Programming Theory of Reals Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative $\mu$-calculus and related probabilistic logics. We present algorithms for computing the metrics on Markov decision processes (MDPs), turn-based stochastic games, and concurrent games. For turn-based games and MDPs, we provide a polynomial-time algorithm based on linear programming for the computation of the one-step metric distance between states. The algorithm improves on the previously known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known bound for Markov chains. For the bisimulation kernel of the metric, which corresponds to probabilistic bisimulation, our algorithm works in time $\calo(n^4)$ for both turn-based games and MDPs; improving the previously best known $\calo(n^9\cdot\log(n))$ time algorithm for MDPs. For a concurrent game $G$, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational $r$, can be accomplished via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding $\calo(|G|^{\calo(|G|^5)})$ time complexity, improving the previously known reduction with $\calo(|G|^{\calo(|G|^7)})$ time complexity. These algorithms can be iterated to approximate the metrics using binary search. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Krishnendu Chatterjee and Luca de Alfaro and Rupak Majumdar and Vishwanath Raman 2008 Is Part Of LIPIcs, Volume 2, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2008.1745 urn:nbn:de:0030-drops-17455 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1745 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode