On the decidability of temporal properties of probabilistic pushdown automata (2005)
| Venue: | In Proc. of STACS’05 |
| Citations: | 27 - 7 self |
BibTeX
@INPROCEEDINGS{Kučera05onthe,
author = {Antonín Kučera},
title = {On the decidability of temporal properties of probabilistic pushdown automata},
booktitle = {In Proc. of STACS’05},
year = {2005},
pages = {145--157},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL ∗ for pPDA is in 2-EXPSPACE, and model-checking the qualitative fragment of PCTL for pPDA is in EXPSPACE. Furthermore, model-checking the qualitative fragment of PCTL is shown to be EXPTIME-hard even for stateless pPDA. Finally, we show that PCTL model-checking is undecidable for pPDA, and PCTL + model-checking is undecidable even for stateless pPDA. 1
