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.
Document type :
Other publications
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00114692
Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 1:56:09 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 7:42:32 PM

File

2001-fifo.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00114692, version 1

Collections

Citation

Franck Pommereau, Christian Stehno. FIFO buffers is hot tie sauce. 2001. ⟨hal-00114692⟩

Share

Metrics

Record views

138

Files downloads

101