Efficient algorithms for verification of recursive probabilistic system

Etessami, Kousha (Principal Investigator)

Status	Finished
Effective start/end date	30/03/13 → 29/03/15

Funding

UK-based charities: £11,950.00

1 Article

Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Etessami, K., Stewart, A. & Yannakakis, M., Aug 2018, In: Information and Computation. 261, 2, p. 355-382 28 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File