Branching-Time Model-Checking of Probabilistic Pushdown Automata

Authors:
Tomáš Brázdil;Václav Brožek;Vojtěch Forejt
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 10
Cited 2

CTL and ECTL as fragments of the modal &mgr;-calculus

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Alternation

Journal of the ACM (JACM)
Temporal Logics for the Specification of Performance and Reliability

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model checking LTL with regular valuations for pushdown systems

Information and Computation - TACS 2001
Model Checking Probabilistic Pushdown Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Checking LTL Properties of Recursive Markov Chains

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
On the decidability of temporal properties of probabilistic pushdown automata

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Complexity results on branching-time pushdown model checking

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Branching-time model-checking of probabilistic pushdown automata

Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time logics PCTL* and PECTL*. We prove tha this problem is in 2-EXPTIME for pPDA and qualitative PCTL*. Consequently, we prove that model-checking of stateless pPDA (pBPA) and both qualitative PCTL* and qualitative PECTL* is 2-EXPTIME-hard. These results combined with results of several other papers give us that the model-checking problem for pPDA (and also for pBPA) and both qualitative PCTL* and qualitative PECTL* is 2-EXPTIME-complete. Finally, we survey known results on model-checking of pPDA and branching-time logics.