Title :
Model checking probabilistic pushdown automata
Author :
J. Esparza;A. Kucera;R. Mayr
Author_Institution :
Inst. for Formal Methods in Comput. Sci., Stuttgart Univ., Germany
fDate :
6/26/1905 12:00:00 AM
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 Buchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable.
Keywords :
"Automata","Computer science","Probabilistic logic","Personal digital assistants","Informatics","Uncertainty","Protocols","Fault tolerant systems","Asynchronous communication","Concurrent computing"
Conference_Titel :
Logic in Computer Science, 2004. Proceedings of the 19th Annual IEEE Symposium on
Print_ISBN :
0-7695-2192-4
DOI :
10.1109/LICS.2004.1319596