Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

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)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (11)

An Algorithm for Probabilistic Alternating Simulation ⋮ A space-efficient simulation algorithm on probabilistic automata ⋮ An efficient algorithm to determine probabilistic bisimulation ⋮ Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions ⋮ Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition ⋮ Unnamed Item ⋮ Three-valued abstraction for probabilistic systems ⋮ Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation ⋮ 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

This page was built for publication: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations