FIFO buffers is hot tie sauce

Abstract : 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.
Type de document :
Autre publication
Technical report 2001-04, LACL. 2001
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00114692
Contributeur : Franck Pommereau <>
Soumis le : vendredi 17 novembre 2006 - 13:56:09
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28
Document(s) archivé(s) le : mardi 6 avril 2010 - 19:42:32

Fichier

2001-fifo.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00114692, version 1

Collections

Citation

Franck Pommereau, Christian Stehno. FIFO buffers is hot tie sauce. Technical report 2001-04, LACL. 2001. 〈hal-00114692〉

Partager

Métriques

Consultations de la notice

129

Téléchargements de fichiers

94