Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification Conference Paper


Author(s): Chatterjee, Krishnendu; Henzinger, Monika
Title: Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification
Affiliation IST Austria
Abstract: We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity objectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m · √m) bound for m > n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity objectives with d priorities, improving the previous O(m · √m · d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m · log d) time for parity ob jectives.
Conference Title: SODA: Symposium on Discrete Algorithms
Conference Dates: January 23 - 24, 2011
Conference Location: San Francisco, CA, USA
ISBN: 1557-9468
Publisher: SIAM  
Date Published: 2011-01-23
Start Page: 1318
End Page: 1336
URL:
DOI: 10.1137/1.9781611973082.101
Open access: yes (repository)
IST Austria Authors
Related IST Austria Work