Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

DOI10.2168/LMCS-4(4:6)2008MaRDI QIDQ3623003zbMATH OpenFDO

Authors Holger Hermanns, Friedrich Eisenbrand, David N. Jansen, Lijun Zhang

Publication date 29 April 2009

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-4(4:6)2008

Mathematics Subject Classification ID

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

Recommendations

• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• scientific article; zbMATH DE number 176067
• An efficient algorithm for simulating ensembles of parameterized flow problems
• Fast simulation of Markov fluid models
• An algorithm for probabilistic alternating simulation
• A Space-Efficient Probabilistic Simulation Algorithm
• On probabilistic alternating simulations
• Flow optimization using stochastic algorithms

Cited in

(14)

• 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
• Deciding Simulations on Probabilistic Automata
• A Space-Efficient Probabilistic Simulation Algorithm
• Three-valued abstraction for probabilistic systems
• Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
• Bisimulations for probabilistic and quantum processes (invited paper)
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623003)