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. © 2011 Springer-Verlag.
CITATION STYLE
Couvreur, J. M., Poitrenaud, D., & Weil, P. (2011). Branching processes of general Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6709 LNCS, pp. 129–148). https://doi.org/10.1007/978-3-642-21834-7_8
Mendeley helps you to discover research relevant for your work.