A Parallel Algorithm for the State Space Exploration - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Article Dans Une Revue Scalable Computing : Practice and Experience Année : 2016

A Parallel Algorithm for the State Space Exploration

Résumé

Model checking has long been used as a means of verification of formal specifications. This is a verification technique of dynamic systems that explores all possible states of the system. It determines whether the given system satisfies its specification. This technique suffers from the state explosion problem when traversing all possible states of systems. Parallel and/or distributed approaches are used to cope with the state space explosion problem. In this article, we propose a synchronized parallel algorithm of exploration based on a fixed number of threads. We present many experiments for a comparison between our parallel approach and the algorithm proposed for a parallel exploration in SPIN. We show by an experimental study that our parallel approach gives encouraging results.

Dates et versions

hal-01373317 , version 1 (28-09-2016)

Identifiants

Citer

Lamia Allal, Ghalem Belalem, Philippe Dhaussy, Ciprian Teodorov. A Parallel Algorithm for the State Space Exploration. Scalable Computing : Practice and Experience, 2016, Scalable Computing: Practice and Experience, 17 (2), pp.129-141. ⟨10.12694/scpe.v17i2.1161⟩. ⟨hal-01373317⟩
235 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More