Petri net semantics of priority systems
Selected papers of the Second Workshop on Concurrency and compositionality
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Proof, language, and interaction
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
PEP - More than a Petri Net Tool
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
High Level Expressions with their SOS Semantics (Extended Abstract)
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
General Refinement for High Level Petri Nets
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Coupling Asynchrony and Interrupts: Place Chart Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
General parameterised refinement and recursion for the M-net calculus
Theoretical Computer Science
A Petri Net Semantics for B(PN)^2 with Procedures
PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems
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
An Algebra of Non-safe Petri Boxes
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Fundamenta Informaticae
| Hi-index | 0.00 |
The aim of this paper is the introduction of preemption in a compositional model, called M-nets, which is based on Petri nets and hence provided with a concurrent semantics. We propose a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. We show that these extensions can be seen as a high-level version of the well studied model of priority systems, and so, can be reduced to Petri nets (without priorities) which retain as much as possible of the original concurrency. As a consequence, Petri nets appear as a model powerful enough to deal with preemption in a compositional way and with a concurrent semantics.