HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Compilation de réseaux de Petri : modèles haut niveau et symétries de processus

Abstract : This work focuses on verification of automated systems using model-checking techniques. We focus on a compromise between potentially contradictory goals: decidability of systems to be verified, expressivity of modeling formalisms, efficiency of verification, and certification of used tools. To do so, we use high level Petri nets annotated by real programming languages. This implies the semi-decidability of most of problems because termination is left to the modeler (like termination of programs is left to the programmer). To handle these models, we choose a compilation approach which produces programs in the model annotation language, this allows to execute them efficiently. Moreover, this compilation is optimizing using model peculiarities. However, this rich expressivity leads to the use of explicit model-checking which allows to have rich model annotations but also allows to easily recover errors from verification, and remains compatible with simulation (these compiled models can be used for efficient simulation). Finally, to tackle the state space explosion problem, we use reduction by symmetries techniques which allow to reduce exploration times and state spaces.
Complete list of metadata

Cited literature [142 references]  Display  Hide  Download

Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Thursday, December 18, 2014 - 10:08:59 AM
Last modification on : Friday, October 23, 2020 - 4:42:14 PM
Long-term archiving on: : Monday, March 23, 2015 - 4:31:27 PM


  • HAL Id : tel-01096725, version 1



Lukasz Fronc. Compilation de réseaux de Petri : modèles haut niveau et symétries de processus. Calcul formel [cs.SC]. Université d'Evry Val d'Essonne, 2013. Français. ⟨tel-01096725⟩



Record views


Files downloads