Back to Search
Start Over
Branching-time model-checking of probabilistic pushdown automata.
- Source :
-
Journal of Computer & System Sciences . Feb2014, Vol. 80 Issue 1, p139-156. 18p. - Publication Year :
- 2014
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00220000
- Volume :
- 80
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Computer & System Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 90490411
- Full Text :
- https://doi.org/10.1016/j.jcss.2013.07.001