The Fixed-Parameter Tractability of Model Checking Concurrent Systems
نویسنده
چکیده
We study the fixed-parameter complexity of model checking temporal logics on concurrent systems that are modeled as the product of finite systems and where the size of the formula is the parameter. We distinguish between asynchronous product and synchronous product. Sometimes it is possible to show that there is an algorithm for this with running time ( ∑ i |Ti|) O(1) · f(|φ|), where the Ti are the component systems and φ is the formula and f is computable function, thus model checking is fixed-parameter tractable when the size of the formula is the parameter. In this paper we concern ourselves with the question, provided fixed-parameter tractability is known, whether it holds for an elementary function f . Negative answers to this question are provided for modal logic and EF logic: Depending on the mode of synchronization we show the non-existence of such an elementary function f under different assumptions from (parameterized) complexity theory. 1998 ACM Subject Classification F.4.1,F.2.0
منابع مشابه
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied.
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFixed-Parameter Tractability, Definability, and Model-Checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For exampl...
متن کاملModel-checking problems, machines and parameterized complexity
iii iv CONTENTS Bibliography 105 Index 109 Chapter 1 Introduction Model-checking problems, in essence, are logic problems asking if a given structure satisfies a given sentence. They are ubiquitous in computer science, although appearing often in seemingly different forms. Two prominent examples are database query and hardware verification, in which databases and hardware are modelled as struct...
متن کاملBounded Fixed-Parameter Tractability and log2n Nondeterministic Bits
Motivated by recent results showing that there are natural parameterized problems that are fixed-parameter tractable, but can only be solved by fixed-parameter tractable algorithms the running time of which depends non-elementarily on the parameter, we propose a notion of bounded fixed-parameter tractability, where the dependence of the running time on the parameter is restricted to be singly e...
متن کامل