On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes
نویسندگان
چکیده
We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for the logic 8L(O; F; U) (equivalent to CTL) in the usual interleaving semantics, but decidable in a standard partial order interpretation.
منابع مشابه
On the model checking problem for branching time logicsand
We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for the logic 8L(O; F; U) (equivalent to CTL) in the usual interleaving semantics, but decidable in a standard partial order interpretation.
متن کاملModel Checking PA-Processes
PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) Chr93] and context-free processes (BPA). They are a simple model for innnite state concurrent systems. We show that the model checking problem for the branching time temporal lo...
متن کاملLogics and Automata for Software Model - Checking 1
While model-checking of pushdown models is by now an established technique in software verification, temporal logics and automata traditionally used in this area are unattractive on two counts. First, logics and automata traditionally used in model-checking cannot express requirements such as pre/post-conditions that are basic to software analysis. Second, unlike in the finite-state world, wher...
متن کاملOn the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems
We study the complexity of the model-checking problem for the branching-time logic CTL∗ and the alternating-time temporal logics ATL/ATL∗ in one-counter processes and one-counter games respectively. The complexity is determined for all three logics when integer weights are input in unary (non-succinct) and binary (succinct) as well as when the input formula is fixed and is a parameter. Further,...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995