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. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Klaudel, H., & Pommereau, F. (2000). A concurrent and compositional Petri net semantics of preemption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1945 LNCS, pp. 318–337). Springer Verlag. https://doi.org/10.1007/3-540-40911-4_19
Mendeley helps you to discover research relevant for your work.