Making Petri Nets Safe and Free of Internal Transitions

Authors:
Eike Best;Philippe Darondeau;Harro Wimmel
Affiliations:
Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. E-mail: eike.best@informatik.uni-oldenburg.de;IRISA, campus de Beaulieu, F-35042 Rennes Cedex, France. E-mail: darondeau@irisa.fr;Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. E-mail: harro.wimmel@informatik.uni-oldenburg.de
Venue:
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Year:
2007

Citing 9
Cited 5

Coloured Petri nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Free choice Petri nets

Free choice Petri nets
Properties of Conflict-Free and Persistent Petri Nets

Journal of the ACM (JACM)
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial

Seminar on Concurrency, Carnegie-Mellon University
Partial orders and the axiomatic theory of shuffle (pomsets)

Partial orders and the axiomatic theory of shuffle (pomsets)
Arbitration-free synchronization

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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

Decomposition Theorems for Bounded Persistent Petri Nets

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Note on Persistent Petri Nets

Concurrency, Graphs and Models
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Separability in persistent petri nets

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Separability in Persistent Petri Nets

Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the following results: that bounded Petri nets can be transformed into pomset-equivalent safe nets; that boundedmarked graphs can be transformed into step-language-equivalent safe marked graphs; that safe labelled marked graphs can be transformed into τ-free safe labelled marked graphs; and that marked graphs can be separated. The paper also lists some open problems that have arisen in this context.