Branching-time model-checking of probabilistic pushdown automata
نویسندگان
چکیده
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 that 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.
منابع مشابه
Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process
In this paper, we settle a problem in probabilistic verification of infinite–state process (specifically, probabilistic pushdown process). We show that model checking stateless probabilistic pushdown process (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
متن کاملReachability Analysis of Pushdown Automata : Application to Model
We apply the symbolic analysis principle to pushdown systems. We represent (possibly innnite) sets of conngurations of such systems by means of nite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantiica-tion (such as model-checking for branching-time logics), we consider the more general class of alternating pushdown ...
متن کاملReachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systems by means of nite state automata In order to reason in a uniform way about analysis problems involving both existential and universal path quanti ca tion such as model checking for branching time logics we consider the more general class of alternating pushdown systems...
متن کاملBisimilarity of Probabilistic Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bi...
متن کاملModel-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL∗). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the modelchecking of probabilistic finite automata against branching-time tempor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 239 شماره
صفحات -
تاریخ انتشار 2009