Branching processes of general Petri nets - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2013

Branching processes of general Petri nets


We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness or safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call true. These coincide with the safe branching processes and unfoldings if N is safe, or weakly safe as in [Engelfriet 1991], but not in general. However, true branching processes and processes satisfy the good order-theoretic properties which make the safe processes of safe nets so useful in practice, and which are known not to hold for the safe processes of a general net. True processes represent therefore good candidates to generalize the theory of safe nets to the general case.
Fichier principal
Vignette du fichier
depliage.pdf (326.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00688138 , version 1 (16-04-2012)
hal-00688138 , version 2 (03-07-2012)



Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil. Branching processes of general Petri nets. Fundamenta Informaticae, 2013, 122 (1-2), pp.31-58. ⟨10.3233/FI-2013-782⟩. ⟨hal-00688138v2⟩
285 View
548 Download



Gmail Mastodon Facebook X LinkedIn More