BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Ivana HUTAŘOVÁ VAŘEKOVÁ. Runtime Analysis of Probabilistic Programs with Unbounded Recursion. In Luca Aceto, Monika Henzinger, Jiří Sgall. Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin: Springer, 2011, s. 319-331. ISBN 978-3-642-22011-1. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{950128, author = {Brázdil, Tomáš and Kiefer, Stefan and Kučera, Antonín and Hutařová Vařeková, Ivana}, address = {Berlin}, booktitle = {Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)}, editor = {Luca Aceto, Monika Henzinger, Jiří Sgall}, keywords = {pushdown automata; probabilistic systems; termination}, language = {eng}, location = {Berlin}, isbn = {978-3-642-22011-1}, pages = {319-331}, publisher = {Springer}, title = {Runtime Analysis of Probabilistic Programs with Unbounded Recursion}, year = {2011} }
TY - JOUR ID - 950128 AU - Brázdil, Tomáš - Kiefer, Stefan - Kučera, Antonín - Hutařová Vařeková, Ivana PY - 2011 TI - Runtime Analysis of Probabilistic Programs with Unbounded Recursion PB - Springer CY - Berlin SN - 9783642220111 KW - pushdown automata KW - probabilistic systems KW - termination N2 - We study the runtime in probabilistic programs with unbounded recursion. As underlying formal model for such programs we use probabilistic pushdown automata (pPDA) which exactly correspond to recursive Markov chains. ER -
BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Ivana HUTAŘOVÁ VAŘEKOVÁ. Runtime Analysis of Probabilistic Programs with Unbounded Recursion. In Luca Aceto, Monika Henzinger, Jiří Sgall. \textit{Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)}. Berlin: Springer, 2011, s.~319-331. ISBN~978-3-642-22011-1.
|