Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets

Authors:
Eike Best;Harro Wimmel
Affiliations:
Carl von Ossietzky Universität Oldenburg, Oldenburg;Universität Koblenz-Landau, Koblenz
Venue:
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Year:
2000

Citing 7
Cited 7

Modeling concurrency with partial orders

International Journal of Parallel Programming
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1

Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Elements of distributed algorithms: modeling and analysis with Petri nets

Elements of distributed algorithms: modeling and analysis with Petri nets
A uniform approach to true-concurrency and interleaving semantics for Petri nets

Theoretical Computer Science
Algebraic Characterization of Petri Net Pomset Semantics

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Principles of High-Level Net Theory

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A survey of equivalence notions for net based systems

Advances in Petri Nets 1992, The DEMON Project

A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems

Fundamenta Informaticae
A Concurrent and Compositional Petri Net Semantics of Preemption

IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Making Petri Nets Safe and Free of Internal Transitions

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Hasse Diagram Generators and Petri Nets

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Canonizable partial order generators

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
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 Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k ∈ N tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a true-concurrency semantics.