A Upper bounds for Newton’s method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata


A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars, probabilistic pushdown automata and recursive Markov chains) is the computation of termination probabilities, and… (More)