The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
[article]
2013
arXiv
pre-print
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 computing these probabilities in turn boils down to computing the least fixed point (LFP) solution of a corresponding monotone polynomial system
arXiv:1302.3741v2
fatcat:s2gxfzszhrajdortxshkuloaba