Branching-time model-checking of probabilistic pushdown automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00073430" target="_blank" >RIV/00216224:14330/14:00073430 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jcss.2013.07.001" target="_blank" >http://dx.doi.org/10.1016/j.jcss.2013.07.001</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2013.07.001" target="_blank" >10.1016/j.jcss.2013.07.001</a>

Result language
angličtina
Original language name
Branching-time model-checking of probabilistic pushdown automata
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F10%2F1469" target="_blank" >GAP202/10/1469: Formal methods for analysis and verification of complex systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)