Practical Efficient Modular Linear-Time Model-Checking

Authors:
Carlo A. Furia;Paola Spoletini
Affiliations:
DEI, Politecnico di Milano, Milano, Italy;DSCPI, Università degli Studi dell'Insubria, Como, Italy
Venue:
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Year:
2008

Citing 8
Cited 0

On the development of reactive systems

Logics and models of concurrent systems
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
An automata-theoretic approach to modular model checking

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the criteria to be used in decomposing systems into modules

Communications of the ACM
Module checking

Information and Computation - Special issue on FLOC '96
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how the modular structure of composite systems can guide the state-space exploration in explicit-state linear-time model-checking and make it more efficient in practice. Given a composite system where every module has input and output variables -- and variables of different modules can be connected -- a total ordering according to which variables are generated is determined, through heuristics based on graph-theoretical analysis of the modular structure. The technique is shown to outperform standard exploration techniques (that do not take the modular structure information into account) by several orders of magnitude in experiments with Spin models of MTL formulas.