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.
Type de document :
Communication dans un congrès
P. Kacsuk and G. Kotsis. 2000, Kluwer Academic Publishers, pp.95-104, 2000
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00114694
Contributeur : Franck Pommereau <>
Soumis le : vendredi 17 novembre 2006 - 14:00:35
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03

Identifiants

  • HAL Id : hal-00114694, version 1

Collections

Citation

Franck Pommereau. FIFO buffers in tie sauce. P. Kacsuk and G. Kotsis. 2000, Kluwer Academic Publishers, pp.95-104, 2000. 〈hal-00114694〉

Partager

Métriques

Consultations de la notice

60