A concurrent and compositional Petri net semantics of preemption - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

A concurrent and compositional Petri net semantics of preemption

Hanna Klaudel

Résumé

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.
Fichier principal
Vignette du fichier
2000-ifm.pdf (236.35 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00114693 , version 1 (17-11-2006)

Identifiants

Citer

Hanna Klaudel, Franck Pommereau. A concurrent and compositional Petri net semantics of preemption. Integrated Formal Methods (IFM), 2000, Dagstuhl, Germany. pp.318-337, ⟨10.1007/3-540-40911-4_19⟩. ⟨hal-00114693⟩
83 Consultations
305 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More