Skip to Main content Skip to Navigation

Exploration randomisée de larges espaces d'états pour la vérification

Nazha Abed 1, 2 
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Nowadays, the automated systems are omnipresent: industrial processes, avionics, atomic energy... The presence of such systems in critical applications, coupled to their complexity makes essential their checking in an automatic way in order to guarantee the safety of their operation. Moreover, the economic constraints impose a short time of development, which makes increased the need for effective checking methods at reduced cost. The Model-Checking algorithms are designed for the total checking of systems by traversing their state graphs. However, the state graphs of real software systems have very big sizes (combinatory explosion of the size of the state space). This phenomenon constitutes the principal obstacle of the automatic checking by model checking. Alternatively, one recourse to the partial exploration via ranomized algorithms. Instead of giving up the exploration because of lack of resources and not to return any answer about the validity of the system, the result of the checking is given roughly with an error probability that one can control. The majority of the randomized methods of checking use random walk as exploration scheme. The methods which we propose operate on the scheme even of the exploration as well as the replacement techniques in memory to bring important performances. These algorithms present a rather complete play of exploration strategies: in-depth, in breadth, or alternatively according to a predefined mixing parameter. The choice of this parameter is guided by a density factor DF that characterizes the considered graph.
Document type :
Complete list of metadata

Cited literature [68 references]  Display  Hide  Download
Contributor : Nazha Abed Connect in order to contact the contributor
Submitted on : Tuesday, January 18, 2011 - 5:17:46 PM
Last modification on : Sunday, June 26, 2022 - 4:56:36 AM
Long-term archiving on: : Tuesday, April 19, 2011 - 3:32:07 AM



  • HAL Id : tel-00557232, version 1




Nazha Abed. Exploration randomisée de larges espaces d'états pour la vérification. Informatique [cs]. Université Joseph-Fourier - Grenoble I, 2009. Français. ⟨tel-00557232⟩



Record views


Files downloads