Branching-Time Model-Checking of Probabilistic Pushdown Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00043829" target="_blank" >RIV/00216224:14330/09:00043829 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Original language description
Complete classifiaction of computational complexity of the model-checking problem for probabilistic pushdown automata and qualitative fragments of the logics PCTL, PCTL* and PECTL* is reached.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Notes in Theoretical Computer Science
ISSN
1571-0661
e-ISSN
—
Volume of the periodical
2009
Issue of the periodical within the volume
239
Country of publishing house
PT - PORTUGAL
Number of pages
11
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—