Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput., 261(Part):355-382, 2018. [doi]

Abstract

Abstract is missing.