In: RAIRO - informatique theorique et Applications - Theoretical Informatics and Applications, Vol. 28, No. 2, pages 73-124. 1994.
Abstract: In this paper, we study composition and decomposition of Petri nets via a common set of places or transitions. We prove that some properties are preserved by these techniques, and some other ones can be obtained by the composition of the covering graphs. We propose some algorithms to decompose a net according to the properties that must be verified. We present an algorithm to compose minimal covering graphs, less expensive than a straightforward construction, concerning as well time as space.
Keywords: Petri nets, coverability graphs, net composition, net decomposition.
Back to the Petri Nets Bibliography