Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
From MaRDI portal
Publication:3623003
DOI10.2168/LMCS-4(4:6)2008zbMath1161.68473MaRDI QIDQ3623003
Friedrich Eisenbrand, Holger Hermanns, David N. Jansen, Li-jun Zhang
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J27: Continuous-time Markov processes on discrete state spaces
Related Items
Unnamed Item, Three-valued abstraction for probabilistic systems, Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition, A space-efficient simulation algorithm on probabilistic automata, An efficient algorithm to determine probabilistic bisimulation, An Algorithm for Probabilistic Alternating Simulation, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation, The How and Why of Interactive Markov Chains, A Spectrum of Behavioral Relations over LTSs on Probability Distributions
