Published Articles >> Table of Contents >> Abstract

19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)   pp. 12-21
Model Checking Probabilistic Pushdown Automata
Javier Esparza, University of Stuttgart, Germany
Antonin Kucera, Masaryk University, Czech Republic
Richard Mayr, Albert-Ludwigs-University Freiburg, Germany

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319596
Send link to a friend

Abstract
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 general PCTL and the subclass of stateless pPDA. Finally, we consider the class of properties definable by deterministic Büchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable.
Back to Top Additional Information
Citation:  Javier Esparza, Antonin Kucera, Richard Mayr, "Model Checking Probabilistic Pushdown Automata," lics, pp. 12-21,  19th Annual IEEE Symposium on Logic in Computer Science (LICS'04),  2004