Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
430023 | Journal of Computer and System Sciences | 2014 | 18 Pages |
Abstract
•We study the model-checking problem for probabilistic pushdown automata (pPDA).•Model-checking pPDA against PCTL formulae is undecidable.•Model-checking pPDA against qualitative PCTL* formulae is decidable.
In this paper we study the model-checking problem for probabilistic pushdown automata (pPDA) and branching-time probabilistic logics PCTL and PCTL⁎. We show that model-checking pPDA against general PCTL formulae is undecidable, but we yield positive decidability results for the qualitative fragments of PCTL and PCTL⁎. For these fragments, we also give a complete complexity classification.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Tomáš Brázdil, Václav Brožek, Vojtěch Forejt, Antonín Kučera,