Separability in conflict-free petri nets

Authors:
Eike Best;Javier Esparza;Harro Wimmel;Karsten Wolf
Affiliations:
Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany;Abteilung Sichere und Zuverlässige Softwaresysteme, Institut für Formale Methoden der Informatik, Universität Stuttgart;Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany;Institut für Informatik, Universität Rostock
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 6
Cited 7

Theory of linear and integer programming

Theory of linear and integer programming
Synchronic distance

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)
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation

Formal Methods in System Design
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

Making Petri Nets Safe and Free of Internal Transitions

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
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
Concurrency, Synchronization, and Conflicts in Petri Nets

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
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
Making Petri Nets Safe and Free of Internal Transitions

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study whether transition sequences that transform markings with multiples of a number k on each place can be separated into k sequences, each transforming one k-th of the original marking. We prove that such a separation is possible for marked graph Petri nets, and present an inseparable sequence for a free-choice net.