Parallel state space construction for model-checking

  • Authors:
  • Hubert Garavel;Radu Mateescu;Irina Smarandache

  • Affiliations:
  • INRIA Rhône-Alpes / Vasy, 655, avenue de l'Europe, F-38330 Montbonnot Saint Martin, France;INRIA Rhône-Alpes / Vasy, 655, avenue de l'Europe, F-38330 Montbonnot Saint Martin, France;INRIA Rhône-Alpes / Vasy, 655, avenue de l'Europe, F-38330 Montbonnot Saint Martin, France

  • Venue:
  • SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

The verification of concurrent finite-state systems by model-checking often requires to generate (a large part of) the state space of the system under analysis. Because of the state explosion problem, this may be a resource-consuming operation, both in terms of memory and CPU time. In this paper, we aim at improving the performances of state space construction by using parallelization techniques. We present parallel algorithms for constructing state spaces (or Labeled Transition Systems) on a network or a cluster of workstations. Each node in the network builds a part of the state space, all parts being merged to form the whole state space upon termination of the parallel computation. These algorithms have been implemented with the CADP verification tool set and experimented on various concurrent applications specified in LOTOS. The results obtained show close to ideal speedups and a good load balancing between network nodes.