On the memory consumption of probabilistic pushdown automata

DOI10.4230/LIPIcs.FSTTCS.2009.2306zbMath1248.68321OpenAlexW1558202744MaRDI QIDQ2920112

Stefan Kiefer, Tomáš Brázdil, Javier Esparza

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f977.html

zbMATH Keywords

verificationpushdown automataprobabilistic systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Space-efficient scheduling of stochastically generated tasks ⋮ On Probabilistic Parallel Programs with Process Creation and Synchronisation

Uses Software

• INFAMY

This page was built for publication: On the memory consumption of probabilistic pushdown automata