A concurrent and compositional Petri net semantics of preemption

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. 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 1:58:39 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:58:18 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00114693, version 1



Hanna Klaudel, Franck Pommereau. A concurrent and compositional Petri net semantics of preemption. 2000, pp.318-337. ⟨hal-00114693⟩



Record views


Files downloads