Efficient Analysis of Probabilistic Programs with an Unbounded Counter
Efficient Analysis of Probabilistic Programs with an Unbounded Counter
复制标题
使用无界计数器对概率程序进行有效分析
DOI:
--
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
A. Kucera
中科院分区:
文献类型:
--
作者:
T. Brázdil;S. Kiefer;A. Kucera
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. We start by establishing 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. Using these observations, we show that the expected termination time can be approximated up to an arbitrarily small relative error in polynomial time, and the same holds for the probability of all runs that satisfy a given ω-regular property encoded by a deterministic Rabin automaton.
DOI:
10.1007/978-3-319-02444-8_32
发表时间:
2013
期刊:
影响因子:
--
作者:
Křetínský;Ruslán Ledesma
通讯作者:
Ruslán Ledesma
DOI:
10.1007/978-3-642-33386-6_7
发表时间:
2012
期刊:
影响因子:
--
作者:
Andreas Gaiser;Jan Křetínský;Javier Esparza
通讯作者:
Javier Esparza
影响因子:
2.2
作者:
Etessami K
通讯作者:
Etessami K