%0 Journal Article
%T A Parallel Algorithm for the State Space Exploration
%+ University of Oran
%+ Lab-STICC_ENSTAB_CACS_MOCS
%A Allal, Lamia
%A Belalem, Ghalem
%A Dhaussy, Philippe
%A Teodorov, Ciprian
%< avec comité de lecture
%@ 1895-1767
%J Scalable Computing : Practice and Experience
%I West University of Timisoara
%S Scalable Computing: Practice and Experience
%V 17
%N 2
%P 129-141
%8 2016-09-01
%D 2016
%R 10.12694/scpe.v17i2.1161
%K reachability graph
%K memory space
%K parallel algo-
%K Model checking
%K state explosion problem
%K parallel exploration
%Z AMS 68Q60, 68W10
%Z Computer Science [cs]/Modeling and Simulation
%Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]Journal articles
%X 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.
%G English
%L hal-01373317
%U https://hal.science/hal-01373317
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ LAB-STICC
%~ TDS-MACS
%~ INSTITUTS-TELECOM