Esparza, Javier and Kucera, Antonin and Mayr, Richard - Model Checking Probabilistic Pushdown Automata

lmcs:2256 - Logical Methods in Computer Science, March 7, 2006, Volume 2, Issue 1
Model Checking Probabilistic Pushdown Automata

Authors: Esparza, Javier and Kucera, Antonin and Mayr, Richard

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.


Source : oai:arXiv.org:cs/0508003
DOI : 10.2168/LMCS-2(1:2)2006
Volume: Volume 2, Issue 1
Published on: March 7, 2006
Submitted on: December 9, 2004
Keywords: Computer Science - Logic in Computer Science,D.2.4,F.1.1,G.3


Share

Consultation statistics

This page has been seen 68 times.
This article's PDF has been downloaded 62 times.