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
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02310048
Contributor : Franck Pommereau <>
Submitted on : Thursday, October 10, 2019 - 2:19:50 PM
Last modification on : Thursday, October 10, 2019 - 2:27:59 PM

File

Pom-DAPSYS-2000.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Franck Pommereau. FIFO Buffers in tie Sauce. Distributed and Parallel Systems, Sep 2000, Balatonfüred, Hungary. pp.95-104, ⟨10.1007/978-1-4615-4489-0_13⟩. ⟨hal-02310048⟩

Share

Metrics

Record views

36

Files downloads

3