@inproceedings{3169b69b0b234efa9dfb316eded2b32e,
title = "Proposed algorithms to the state explosion problem",
abstract = "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.",
keywords = "Model checking, Parallel exploration, Reachability graph, State explosion problem",
author = "Lamia Allal and Ghalem Belalem and Philippe Dhaussy and Ciprian Teodorov",
note = "Publisher Copyright: {\textcopyright} Springer Nature Singapore Pte Ltd. 2016.; 1st International Conference on Smart Trends in Information Technology and Computer Communications, SmartCom 2016 ; Conference date: 06-08-2016 Through 07-08-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-981-10-3433-6\_26",
language = "English",
isbn = "9789811034329",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "211--217",
editor = "Malaya Nayak and Dharm Singh and Mishra, \{Durgesh Kumar\} and Aynur Unal and Amit Joshi",
booktitle = "Smart Trends in Information Technology and Computer Communications - 1st International Conference, SmartCom 2016, Revised Selected Papers",
}