3 papers
cs.LO2026
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
Milan Češka, Sebastian Junges, Luko van der Maas +2
Computing optimal conditional reachability probabilities in Markov decision processes (MDPs) is tractable by a reduction to reachability probabilities. Yet, this reduction yields c…
cs.LO2026
Shields to Guarantee Probabilistic Safety in MDPs
Linus Heck, Filip Macák, Roman Andriushchenko +2
Shielding is a prominent model-based technique to ensure safety of autonomous agents. Classical shielding aims to ensure that nothing bad ever happens and comes with strong guarant…
cs.LO2025
Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking
Linus Heck, Filip Macák, Milan Češka +1
The ability to compute reward-optimal policies for given and known finite Markov decision processes (MDPs) underpins a variety of applications across planning, controller synthesis…