%0 Book Section
%T Proposed Algorithms to the State Explosion Problem
%+ Université d'Oran 1 Ahmed Ben Bella [Oran]
%+ Lab-STICC_ENSTAB_ CACS_MOCS
%A Allal, Lamia
%A Belalem, Ghalem
%A Dhaussy, Philippe
%A Teodorov, Ciprian
%@ 978-981-10-3433-6 (eBook); 978-981-10-3432-9 (Softcover)
%B Smart Trends in Information Technology and Computer Communications. First International Conference, SmartCom 2016, Jaipur, India, August 6–7, 2016, Revised Selected Papers
%E Aynur Unal; Malaya Nayak; Durgesh Kumar Mishra; Dharm Singh; Joshi Amit
%I Springer
%C Singapore
%S Communications in Computer and Information Science book series (CCIS)
%V 628
%P 211-217
%8 2016
%D 2016
%R 10.1007/978-981-10-3433-6_26
%K Model checking
%K State explosion problem
%K Parallel exploration
%K Reachability graph
%Z Computer Science [cs]
%Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]
%Z Computer Science [cs]/Software Engineering [cs.SE]Book sections
%X Model checking is a very powerful formal verification technique. Formal verification of complex systems is a major challenge in many areas of human society. The verification of properties of these systems is recognized as a difficult problem and faces a number of practical and theoretical problems. The main limitation of the formal verification is known as the state explosion problem. In this paper, we discuss about two contributions to this problem for the improvement of performance in time and memory space.
%G English
%L hal-02515359
%U https://hal.science/hal-02515359
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ ENIB
%~ LAB-STICC
%~ INSTITUTS-TELECOM