Proposed Algorithms to the State Explosion Problem - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Chapitre D'ouvrage Année : 2016

Proposed Algorithms to the State Explosion Problem


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.
Fichier non déposé

Dates et versions

hal-02515359 , version 1 (23-03-2020)



Lamia Allal, Ghalem Belalem, Philippe Dhaussy, Ciprian Teodorov. Proposed Algorithms to the State Explosion Problem. Aynur Unal; Malaya Nayak; Durgesh Kumar Mishra; Dharm Singh; Joshi Amit. Smart Trends in Information Technology and Computer Communications. First International Conference, SmartCom 2016, Jaipur, India, August 6–7, 2016, Revised Selected Papers, 628, Springer, pp.211-217, 2016, Communications in Computer and Information Science book series (CCIS), 978-981-10-3433-6 (eBook); 978-981-10-3432-9 (Softcover). ⟨10.1007/978-981-10-3433-6_26⟩. ⟨hal-02515359⟩
43 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More