FIFO buffers is hot tie sauce - Archive ouverte HAL Accéder directement au contenu
Autre Publication Scientifique Année : 2001

FIFO buffers is hot tie sauce

Résumé

This paper introduces a new semantics for FIFO buffers (usually called channels) in a parallel programming language, B(PN)². This semantics is given in terms of M-nets, which form an algebra of labelled high-level Petri nets. The proposed approach uses the asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the original M-net semantics. Channels are now fully expressible within the algebra (it was not the case), they are significantly smaller (in number of places), and they offer several other advantages.
Fichier principal
Vignette du fichier
2001-fifo.pdf (145.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

  • HAL Id : hal-00114692 , version 1

Citer

Franck Pommereau, Christian Stehno. FIFO buffers is hot tie sauce. 2001. ⟨hal-00114692⟩
176 Consultations
129 Téléchargements

Partager

Gmail Facebook X LinkedIn More