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

@article{Stewart2015UpperBF,
  title={Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata},
  author={Alistair Stewart and Kousha Etessami and Mihalis Yannakakis},
  journal={J. ACM},
  year={2015},
  volume={62},
  pages={30:1-30:33}
}
A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multitype branching processes, stochastic context-free grammars, probabilistic pushdown automata and recursive Markov chains) is the computation of termination probabilities, and computing these probabilities in turn boils down to computing the least fixed point (LFP) solution of a corresponding monotone polynomial system (MPS… CONTINUE READING