Runtime Analysis of Probabilistic Programs with Unbounded Recursion-Reference-Cited by-同舟云学术

Runtime Analysis of Probabilistic Programs with Unbounded Recursion

Published:2011 Issue: Volume: Page:319-331
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Brázdil Tomáš,Kiefer Stefan,Kučera Antonín,Vařeková Ivana Hutařová

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22012-8_25

Reference27 articles.

1. Bini, D., Latouche, G., Meini, B.: Numerical methods for Structured Markov Chains. Oxford University Press, Oxford (2005)

2. Brázdil, T.: Verification of Probabilistic Recursive Sequential Programs. PhD thesis, Masaryk University, Faculty of Informatics (2007)

3. Lecture Notes in Artificial Intelligence;T. Brázdil,2008

4. Brázdil, T., Brožek, V., Etessami, K.: One-counter stochastic games. In: Proceedings of ST&TCS 2010. Leibniz International Proceedings in Informatics, vol. 8, pp. 108–119. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (2010)

5. Brázdil, T., Brožek, V., Etessami, K., Kučera, A., Wojtczak, D.: One-counter Markov decision processes. In: Proceedings of SODA 2010, pp. 863–874. SIAM, Philadelphia (2010)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Language equivalence of probabilistic pushdown automata;Information and Computation;2014-10

3. Zero-reachability in probabilistic multi-counter automata;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

4. Analyzing probabilistic pushdown automata;Formal Methods in System Design;2012-07-20

5. Stabilization of Branching Queueing Networks;LEIBNIZ INT PR INFOR;2012