In: Lecture Notes in Computer Science, Vol. 1945: Integrated Formal Methods, pages 318-337. Springer-Verlag, 2000.
Abstract: 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. The paper proposes a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. It shows 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 on a compositional way and with a concurrent semantics.
Keywords: M-nets, Petri nets, compositionality, concurrency, preemption, priority systems.