59 citations · 458 across the 94 of their papers we have counts for
4 papers · 1 filter
Safety-Constrained Reinforcement Learning for MDPs
Sebastian Junges, Nils Jansen, Christian Dehnert +2
We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process…
On the Hardness of Almost-Sure Termination
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown th…
On the Hardness of PCTL Satisfiability
Souymodip Chakraborty, Joost-Pieter Katoen
This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from -player games with PCTL winning objective…
Conditioning in Probabilistic Programming
Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski +3
We investigate the semantic intricacies of conditioning, a main feature in probabilistic programming. We provide a weakest (liberal) pre-condition (w(l)p) semantics for the element…