Separability in Persistent Petri Nets

Authors:
Eike Best;Philippe Darondeau
Affiliations:
(Correspd.) (Would like to thank the Université de Rennes 1 for inviting him at IRISA during February 2009) Parallel Systems, Department of Computing Science, Carl von Ossietzky Universit ...;INRIA, Centre Rennes - Bretagne Atlantique, Campus de Beaulieu, F-35042 Rennes Cedex, France. Philippe.Darondeau@inria.fr
Venue:
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Year:
2011

Citing 7
Cited 1

Properties of Conflict-Free and Persistent Petri Nets

Journal of the ACM (JACM)
A Fundamental Tehoerem of Asynchronous Parallel Computation

Proceedings of the Sagamore Computer Conference on Parallel Processing
Making Petri Nets Safe and Free of Internal Transitions

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A decomposition theorem for finite persistent transition systems

Acta Informatica
Marked directed graphs

Journal of Computer and System Sciences
Soundness and separability of workflow nets in the stepwise refinement approach

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Separability in conflict-free petri nets

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics

A taxonomy of persistent and nonviolent steps

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency

Quantified Score

Hi-index	0.00

Visualization

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.