The complexity of reachability in parametric Markov decision processes

Source
Journal of computer and system sciences - ISSN 0022-0000-119 (2021) p. 183-210
Author(s)

When are emptiness and containment decidable for probabilistic automata?

Source
Journal of computer and system sciences - ISSN 0022-0000-119 (2021) p. 78-96
Author(s)

Coverability in 1-VASS with disequality tests

Source
LIPIcs : Leibniz International Proceedings in Informatics-171:38 (2020) p. 1-20
Author(s)

Finite-memory near-optimal learning for Markov decision processes with long-run average reward

Source
Journal of machine learning research-124 (2020) p. 1149-1158
Author(s)