ESPARZA, Javier, Antonín KUČERA and Richard MAYR. Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science. 2006, vol. 2, 1-2, p. 1-31. ISSN 1860-5974.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Model Checking Probabilistic Pushdown Automata
Name in Czech Ověřování formulí temporálních logik pro pravděpodobnostní zásobníkové automaty
Authors ESPARZA, Javier (724 Spain), Antonín KUČERA (203 Czech Republic, guarantor) and Richard MAYR (276 Germany).
Edition Logical Methods in Computer Science, 2006, 1860-5974.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
WWW LMCS home page
RIV identification code RIV/00216224:14330/06:00016670
Organization unit Faculty of Informatics
UT WoS 000223180900002
Keywords in English pushdown automata; Markov chains; probabilistic model checking
Tags Markov chains, probabilistic model checking, pushdown automata
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:26.
Abstract
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for PCTL and the subclass of stateless pPDA. Finally, we consider the class of omega-regular properties and show that both qualitative and quantitative model checking for pPDA is decidable.
Abstract (in Czech)
V článku se zkoumá problém algoritmické ověřitelnosti dané formule temporální logiky pro daný pravděpodobnostní zásobníkový automat. Nejprve jsou vyšetřeny formule, které lze specifikovat jako parametrizovanou náhodnou procházku. Pak jsou vyšetřeny obecnější formule definovatelné v logice PCTL a jejím kvalitativním fragmentu.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 8/6/2024 22:43