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.
Type de document :
Communication dans un congrès
W. Grieskamp, T. Santen and B. Stoddart. 2000, Springer, pp.318-337, 2000, Lecture Notes in Computer Science 1945
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00114693
Contributeur : Franck Pommereau <>
Soumis le : vendredi 17 novembre 2006 - 13:58:39
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03
Document(s) archivé(s) le : mardi 6 avril 2010 - 22:58:18

Fichier

2000-ifm.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00114693, version 1

Collections

Citation

Hanna Klaudel, Franck Pommereau. A concurrent and compositional Petri net semantics of preemption. W. Grieskamp, T. Santen and B. Stoddart. 2000, Springer, pp.318-337, 2000, Lecture Notes in Computer Science 1945. 〈hal-00114693〉

Partager

Métriques

Consultations de la notice

135

Téléchargements de fichiers

185