Computer Science – Logic in Computer Science
Scientific paper
2008-08-27
LMCS 4 (4:6) 2008
Computer Science
Logic in Computer Science
LMCS
Scientific paper
10.2168/LMCS-4(4:6)2008
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 polynomial complexity via a reduction to an LP problem. When extending the algorithms for probabilistic automata to their continuous-time counterpart, we retain the same complexity for both strong and strong probabilistic simulations.
Eisenbrand Friedrich
Hermanns Holger
Jansen David N.
Zhang Lijun
No associations
LandOfFree
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations 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 Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-528382