Model-Checking of Ordered Multi-Pushdown Automata
نویسندگان
چکیده
منابع مشابه
Model-Checking of Ordered Multi-Pushdown Automata
We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushdown automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown automata, the set o...
متن کاملGlobal Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations such that a pop can only be performed on the first non-empty stack. First, we show that for an ordered multi-pushdown system the set of all predecessors of a regular set of configurations is an effectively constructible...
متن کاملModel-Checking Bounded Multi-Pushdown Systems
We provide complexity characterizations of model checking multi-pushdown systems. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time temporal logic extending well-known logic CaRet but dedicated to multi-pushdown systems in which abstract operators are parameterized by stacks. We show that the pro...
متن کامل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...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(3:20)2012