Skip to Main content Skip to Navigation

Méthodes d'analyse hiérarchique des réseaux de Petri

Abstract : The aim of this thesis is to define hierarchical analysis methods for Petri nets (a formalism for modelling distributed system control). First, we study the net transformation consisting in replacing open subnets: an equivalence notion is defined, such that if an open subnet is replaced with an equivalent net. The net obtained is equivalent to the original one; then, we define the reentrant net class, for which the equivalence verification, complex in general, becomes simple. Secondly, the investigation of net composition by merging places gives two results: the preservation of home space property if some conditions of independence wrt the shared places are fulfilled, and the preservation of deadlock-freeness when composing ordered-resource nets (in a sense different form the classical solution). Finally, a new norm concept for proving home space property is defined, with composition operations allowing a modular verification of this property.
Document type :
Complete list of metadata

Cited literature [65 references]  Display  Hide  Download
Contributor : Ecole Des Ponts Paristech Connect in order to contact the contributor
Submitted on : Tuesday, September 21, 2010 - 10:56:26 AM
Last modification on : Tuesday, April 24, 2018 - 1:32:42 PM
Long-term archiving on: : Wednesday, December 22, 2010 - 2:41:51 AM


Files produced by the author(s)


  • HAL Id : tel-00519683, version 1



Ghassan Chehaibar. Méthodes d'analyse hiérarchique des réseaux de Petri. Modélisation et simulation. Ecole Nationale des Ponts et Chaussées, 1991. Français. ⟨tel-00519683⟩



Record views


Files downloads