FIFO buffers in tie sauce

Abstract : This paper introduces a new semantics for FIFO buffers (more 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 makes usage of asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the previous 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 :
Conference papers
Liste complète des métadonnées
Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 2:00:35 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM


  • HAL Id : hal-00114694, version 1



Franck Pommereau. FIFO buffers in tie sauce. 2000, pp.95-104. ⟨hal-00114694⟩



Record views