A Parametric Analysis of the State Explosion Problem in Model Checking

Authors:
Stéphane Demri;François Laroussinie;Ph. Schnoebelen
Affiliations:
-;-;-
Venue:
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2002

Citing 19
Cited 2

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The parameterized complexity of sequence alignment and consensus

Theoretical Computer Science
Deciding true concurrency equivalences on safe, finite nets

ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Complexity of equivalence problems for concurrent systems of finite agents

Information and Computation
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the complexity of database queries

Journal of Computer and System Sciences
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Symbolic model checking for &mgr;-calculus requires exponential time

Theoretical Computer Science
When is the evaluation of conjunctive queries tractable?

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Complexity of Verifying Concurrent Transition Systems

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
P-Hardness of Equivalence Testing on Finite-State Processes

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Descriptive and Parameterized Complexity

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Parameterized Complexity

Parameterized Complexity

A parametric analysis of the state-explosion problem in model checking

Journal of Computer and System Sciences
From logic to games

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In model checking, the state explosion problem occurs when one verifies a non-flat system, i.e. a system described implicitly as a synchronized product of elementary subsystems. In this paper, we investigate the complexity of a wide variety of model checking problems for non-flat systems under the light of parameterized complexity, taking the number of synchronized components as a parameter. We provide precise complexity measures (in the parameterized sense) for most of the problems we investigate, and evidence that the results are robust.