Skip to Main content Skip to Navigation
Theses

Model checking parallèle et réparti de réseaux de Petri colorés de haut-niveau : application à la vérification automatique de programmes Ada concurrents

Abstract : This thesis enters in the frame of the automatic verification of concurrent software based on an intermediary formal language : high-level colored Petri nets. We particularly endeavor to tackle the combinatorial explosion phenomenon induced by exhaustive exploration of all possible inter leavings of a system. We focus on taking advantage of the amount of memory and computing resources provided by a local network of workstations working cooperatively. For more efficiency, distribution of the system accessibility graph is based upon a structural analysis of the model. We also aim at preserving in this distributed environment the other techniques that try to limit the combinatorial explosion. We especially relax constraints on the graph exploration consistency. These approaches have then been validated and evaluated with our distributed and multithreaded model checker.
Document type :
Theses
Complete list of metadatas

Cited literature [144 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00812685
Contributor : Theses Bupmc <>
Submitted on : Friday, April 12, 2013 - 3:49:22 PM
Last modification on : Friday, January 8, 2021 - 5:38:07 PM
Long-term archiving on: : Saturday, July 13, 2013 - 4:08:38 AM

Identifiers

  • HAL Id : tel-00812685, version 1

Citation

Christophe Pajault. Model checking parallèle et réparti de réseaux de Petri colorés de haut-niveau : application à la vérification automatique de programmes Ada concurrents. Modélisation et simulation. Université Pierre et Marie Curie - Paris VI, 2008. Français. ⟨NNT : 2008PA066211⟩. ⟨tel-00812685⟩

Share

Metrics

Record views

482

Files downloads

3470