2007
Branching-Time Model-Checking of Probabilistic Pushdown Automata
BRÁZDIL, Tomáš; Václav BROŽEK and Vojtěch FOREJTBasic information
Original name
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Name in Czech
Ověřování modelu pro logiky větvícího se času nad pravděpodobnostními zásobníkovými automaty
Authors
BRÁZDIL, Tomáš (203 Czech Republic, guarantor, belonging to the institution); Václav BROŽEK (203 Czech Republic, belonging to the institution) and Vojtěch FOREJT (203 Czech Republic, belonging to the institution)
Edition
Proc. of 9th Internat. Workshop on Verification of Infinite-State Systems, 2007
Other information
Language
English
Type of outcome
Presentations at conferences
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Portugal
Confidentiality degree
is not subject to a state or trade secret
RIV identification code
RIV/00216224:14330/07:00047829
Organization unit
Faculty of Informatics
Keywords in English
model-checking; Markov chains; temporal logics; probabilistic pushdown automata
Tags
International impact, Reviewed
Changed: 22/4/2011 14:59, RNDr. Václav Brožek, Ph.D.
In the original language
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.
In Czech
Byla dosažena úplná klasifikace výpočetní složitosti problému ověření modelu pro pravděpodobnostní zásobníkové automaty a kvalitativní fragmenty logik PCTL, PCTL* a PECTL*.
Links
| MSM0021622419, plan (intention) |
| ||
| 1M0545, research and development project |
|