I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Reference:

Tomáš Brázdil, Stefan Kiefer, and Antonín Kučera. Efficient analysis of probabilistic programs with an unbounded counter. In G. Gopalakrishnan and S. Qadeer, editors, Proceedings of the 23rd International Conference on Computer Aided Verification (CAV), volume 6806 of LNCS, pages 208–224, Snowbird, Utah, USA, 2011. Springer.

Abstract:

We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In particular, we show that the expected termination time can be approximated up to an arbitrarily small relative error with polynomially many arithmetic operations, and the same holds for the probability of all runs that satisfy a given omega-regular property. Further, our results establish a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC. In particular, we provide a ``divergence gap theorem'', which bounds a positive non-termination probability in pOC away from zero.

Suggested BibTeX entry:

@inproceedings{BKK:CAV11,
    address = {Snowbird, Utah, USA},
    author = {Tom\'{a}\v{s} Br\'{a}zdil and Stefan Kiefer and Anton\'{\i}n Ku\v{c}era},
    booktitle = {Proceedings of the 23rd International Conference on Computer Aided Verification (CAV)},
    editor = {G. Gopalakrishnan and S. Qadeer},
    pages = {208--224},
    publisher = {Springer},
    series = {LNCS},
    title = {Efficient Analysis of Probabilistic Programs with an Unbounded Counter},
    volume = {6806},
    year = {2011}
}

PDF (177 kB)
Slides 
Tech report version, Journal version