Parallel State Space Construction for Model-Checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Parallel State Space Construction for Model-Checking


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 report, 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 within the CADP verification tool set and experimented on various concurrent applications specified in LOTOS. The results obtained show linear speedups and a good load balancing between network nodes.
Fichier principal
Vignette du fichier
RR-4341.pdf (228.09 Ko) Télécharger le fichier

Dates and versions

inria-00072247 , version 1 (23-05-2006)


  • HAL Id : inria-00072247 , version 1


Hubert Garavel, Radu Mateescu, Irina Smarandache. Parallel State Space Construction for Model-Checking. [Research Report] RR-4341, INRIA. 2001. ⟨inria-00072247⟩
92 View
892 Download


Gmail Facebook Twitter LinkedIn More