Affiliations: Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. eike.best@informatik.uni-oldenburg.de | INRIA, Centre Rennes - Bretagne Atlantique, Campus de Beaulieu, F-35042 Rennes Cedex, France. Philippe.Darondeau@inria.fr
Note: [] Address for correspondence: C.v.O. Univ. Oldenburg, D-26111 Oldenburg, Germany The first author would like to thank the Université de Rennes 1 for inviting him at IRISA during February 2009
Abstract: Separability in Petri nets means the property for a net k · N with an initial marking k · M to behave in the same way as k parallel instances of the same net N with an initial marking M, thus divided by k. We prove the separability of plain, bounded, reversible and persistent Petri nets, a class of nets that extends the well-known live and bounded marked graphs. We establish first a weak form of separability, already known to hold for marked graphs, in which every firing sequence of k · N is simulated by a firing sequence of k parallel instances of N with an identical firing count. We establish on top of this a strong form of separability, in which every firing sequence of k · N is simulated by an identical firing sequence of k parallel instances of N.
