Rapport de Recherche CEDRIC 91--09. Centre d'Etudes et de Recherche en Informatique du Conservatoire National des Arts et Métiers, Paris, France, 1991.
Abstract: The authors study composition and decomposition of Petri nets via a common set of places and transitions. They are interested in automatical verification of Petri nets properties from the point of view of reusability of partial results already obtained. The authors give two algorithms which allow to compute the minimal covering graph of a Petri net by composing the minimal covering graphs if each of its modules.
Keywords: (avoiding) state explosion (by) composition (of) minimal covering graph(s); decomposition; automatical verification (of) net property.