Logic in Computer Science (LICS 2004)

Paper: Model Checking Probabilistic Pushdown Automata (at LICS 2004)

Authors: Javier Esparza Antonin Kucera Richard Mayr

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.

BibTeX

  @InProceedings{EsparzaKuceraMayr-ModelCheckingProbab,
    author = 	 {Javier Esparza and Antonin Kucera and Richard Mayr},
    title = 	 {Model Checking Probabilistic Pushdown Automata},
    booktitle =  {Proceedings of the Nineteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2004},
    year =	 2004,
    editor =	 {Harald Ganzinger},
    month =	 {July}, 
    pages =      {12--21},
    location =   {Turku, Finland}, 
    publisher =	 {IEEE Computer Society Press}
  }