A new efficient algorithm computes optimal conditional reachability probabilities in MDPs without creating hard cyclic reductions, achieving linear time on acyclic cases and substantial speedups on benchmarks from Bayesian networks, probabilistic programs, and runtime monitoring.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
New framework for probabilistic safety shields in MDPs showing impossibility of strong classical guarantees and providing weaker but usable alternatives with offline and online constructions.
Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.
citing papers explorer
-
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
A new efficient algorithm computes optimal conditional reachability probabilities in MDPs without creating hard cyclic reductions, achieving linear time on acyclic cases and substantial speedups on benchmarks from Bayesian networks, probabilistic programs, and runtime monitoring.
-
Shields to Guarantee Probabilistic Safety in MDPs
New framework for probabilistic safety shields in MDPs showing impossibility of strong classical guarantees and providing weaker but usable alternatives with offline and online constructions.
-
Extending QuAK with Nested Quantitative Automata
Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.