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

Authors:
S. Demri;F. Laroussinie;Ph. Schnoebelen
Affiliations:
Laboratoire Spécification et Vérification, CNRS & ÉÉcole Normale Supérieure de Cachan 61, avenue Président Wilson, 94235 Cachan Cedex, France;Laboratoire Spécification et Vérification, CNRS & ÉÉcole Normale Supérieure de Cachan 61, avenue Président Wilson, 94235 Cachan Cedex, France;Laboratoire Spécification et Vérification, CNRS & ÉÉcole Normale Supérieure de Cachan 61, avenue Président Wilson, 94235 Cachan Cedex, France
Venue:
Journal of Computer and System Sciences
Year:
2006

Citing 31
Cited 5

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The complexity of combinatorial problems with succinct input representation

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
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
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
On model checking for the &mgr;-calculus and its fragments

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

Information and Computation
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of propositional linear temporal logics in simple cases

Information and Computation
Fixed-Parameter Tractability, Definability, and Model-Checking

SIAM Journal on Computing
The Emptiness Problem for Intersections of Regular Languages

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
A Parametric Analysis of the State Explosion Problem in Model Checking

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Describing Parameterized Complexity Classes

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Alphabet-Based Synchronisation is Exponentially Cheaper

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Preprocessing of intractable problems

Information and Computation
The turing way to parameterized complexity

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Model-Checking Problems as a Basis for Parameterized Intractability

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Parameterized Complexity

Parameterized Complexity

Declarative specification and verification of service choreographiess

ACM Transactions on the Web (TWEB)
Abductive Logic Programming as an Effective Technology for the Static Verification of Declarative Business Processes

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Parameterized complexity results for 1-safe Petri nets

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Weak Kripke structures and LTL

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Aligning SysML with the B method to provide V&V for systems engineering

Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In model checking, the state-explosion problem occurs when one checks a nonflat system, i.e., a system implicitly described as a synchronized product of elementary subsystems. In this paper, we investigate the complexity of a wide variety of model-checking problems for nonflat 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.