In this paper we study the model-checking problem for probabilistic pushdown automata (pPDA) and branching-time probabilistic logics PCTL and PCTL⁎.
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata. (pPDA) and qualitative fragments of two branching-time ...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time ...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time ...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time ...
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses. 39 Citations.
Abstract This paper studies the decidability and computational complexity of checking probabilistic simulation pre-order between probabilistic pushdown automata ...
TL;DR: It is shown that model checking pBPA against PCTL is undecidable, which means model checking stateless probabilistic pushdown process (pBPA) against ...
The undecidability of model-checking problems against branching-time temporal logics are derived by constructing a probabilistic one-counter automaton with ...
In this paper we study the model-checking problem for probabilistic pushdown automata (pPDA) and branching-time probabilistic logics PCTL and PCTL^@?