Faster Algorithms for Markov Decision Processes with Low Treewidth

Krishnendu Chatterjee, Jakub Łącki

We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decisi…