Other formats:
BibTeX
LaTeX
RIS
@inproceedings{556531, author = {Esparza, Javier and Kučera, Antonín and Mayr, Richard}, address = {Los Alamitos (California)}, booktitle = {Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)}, keywords = {Probabilistic Pushdown Automata; Model Checking}, language = {eng}, location = {Los Alamitos (California)}, isbn = {0-7695-2192-4}, pages = {12-21}, publisher = {IEEE Computer Society}, title = {Model Checking Probabilistic Pushdown Automata}, year = {2004} }
TY - JOUR ID - 556531 AU - Esparza, Javier - Kučera, Antonín - Mayr, Richard PY - 2004 TI - Model Checking Probabilistic Pushdown Automata PB - IEEE Computer Society CY - Los Alamitos (California) SN - 0769521924 KW - Probabilistic Pushdown Automata KW - Model Checking N2 - 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 general PCTL and the subclass of stateless pPDA. Finally, we consider the class of properties definable by deterministic Buchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable. ER -
ESPARZA, Javier, Antonín KUČERA and Richard MAYR. Model Checking Probabilistic Pushdown Automata. In \textit{Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)}. Los Alamitos (California): IEEE Computer Society, 2004, p.~12-21. ISBN~0-7695-2192-4.
|