Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen

TL;DR
This paper introduces significantly more efficient algorithms for deciding simulation relations in Markov chains and probabilistic automata, leveraging parametric maximum flow and LP techniques to improve computational complexity.
Contribution
It presents novel algorithms with improved efficiency for strong and weak simulation decisions in Markov chains and probabilistic automata, including polynomial-time solutions.
Findings
Algorithms for Markov chain simulation are drastically improved.
New polynomial-time algorithm for probabilistic automata simulation.
Complexity remains consistent when extending to continuous-time models.
Abstract
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak simulation over Markov chains, and for strong simulation over probabilistic automata are not efficient, which makes it as yet unclear whether they can be used as effectively as their non-probabilistic counterparts. This paper presents drastically improved algorithms to decide whether some (discrete- or continuous-time) Markov chain strongly or weakly simulates another, or whether a probabilistic automaton strongly simulates another. The key innovation is the use of parametric maximum flow techniques to amortize computations. We also present a novel algorithm for deciding strong probabilistic simulation preorders on probabilistic automata, which has…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
