| |
VOLUME 2, ISSUE 1, PAPER 2
|
Model Checking Probabilistic Pushdown Automata
|
©Antonín Kučera, Faculty of Informatics, Masaryk University
©Javier Esparza, Institute for Formal Methods in Computer
Science, University of Stuttgart
©Richard Mayr, North Carolina State University
|
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
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.
|
Publication date: March 7, 2006
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-2(1:2)2006
Hit Counts: 3375 |
 Creative Commons | |
