Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
international colloquium on automata languages and programming, pp. 355-382, 2018.
We give polynomial time algorithms for quantitative and qualitative reachability analysis for Branching Markov Decision Processes BMDPs. Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize or minimize the probability of eventually reaching a population that contains an object o...More
PPT (Upload PPT)