COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS

DOI10.4230/LIPIcs.STACS.2010.2468zbMath1230.65022OpenAlexW2964097106MaRDI QIDQ3113763

Andreas Gaiser, Stefan Kiefer, Javier Esparza

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c316.html

zbMATH Keywords

branching processesnumerical approximationstochastic modelscomputing fixed points

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Space-efficient scheduling of stochastically generated tasks ⋮ A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes ⋮ Unnamed Item ⋮ Analyzing probabilistic pushdown automata ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Unnamed Item

Uses Software

• gmp

This page was built for publication: COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS