Model Checking Probabilistic Pushdown Automata

Antonín Kucera, Javier Esparza, Richard Mayr

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for PCTL and the subclass of stateless pPDA. Finally, we consider the class of omega-regular properties and show that both qualitative and quantitative model checking for pPDA is decidable.
Original languageEnglish
Number of pages31
JournalLogical Methods in Computer Science
Issue number1
Publication statusPublished - 7 Mar 2006


Dive into the research topics of 'Model Checking Probabilistic Pushdown Automata'. Together they form a unique fingerprint.

Cite this