Advertisement

FIFO Buffers in tie Sauce

  • Franck Pommereau
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 567)

Abstract

This paper introduces a new semantics for FIFO buffers (more usually called channels) in a parallel programming language, B(PN)2. 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.

Keywords

Parallel programming Petri nets process algebras FIFO buffers semantics 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. Benzaken, N. Hugon, H. Klaudel, and E. Pelz. M-net calculus based semantics for triggers. LNCS 1420, 1998.Google Scholar
  2. [2]
    E. Best. A memory module specification using composable high-level Petri nets. LNCS 1169, 1996.Google Scholar
  3. [3]
    E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. LNCS 665:130–140, 1993.MathSciNetGoogle Scholar
  4. [4]
    E. Best, R. Devillers, and J. G. Hall. The box calculus: a new causal algebra with multi-label communication. LNCS 609:21–69, 1992.MathSciNetGoogle Scholar
  5. [5]
    E. Best, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica 35, 1998.Google Scholar
  6. [6]
    E. Best and R. P. Hopkins. B(PN)2 — A basic Petri net programming notation. PARLE’93, LNCS 694:379–390, 1993.Google Scholar
  7. [7]
    H. Fleishhack and B. Grahlmann. A Petri net semantics for B(PN)2 with procedures. PDSE’97. IEEE Computer Society, 1997.Google Scholar
  8. [8]
    B. Grahlmann. The PEP tool. CAV’97, LNCS 1254:440–443, 1997.Google Scholar
  9. [9]
    H. Klaudel. Compositional high-level Petri net semantics of a parallel programming language with procedures. Submitted paper (available on http://www.univ-paris12.fr/~lacl/klaudel/pr.ps.gz)/~lacl/klaudel/pr.ps.gz).
  10. [10]
    H. Klaudel and F. Pommereau. Asynchronous links in the PBC and M-nets. ASIAN’99, LNCS 1742:190–200, 1999.Google Scholar
  11. [11]
    H. Klaudel and F. Pommereau. Petri net nemantics of abortion, timeout and exceptions. Technical Report 0021, LACL, Université Paris 12, February 2000.Google Scholar
  12. [12]
    H. Klaudel and R.-C. Riemann. Refinement-based smantics od parallel procedures. PDPTA’99, vol. 4. CSREA Press, 1999.Google Scholar
  13. [13]
    J. Lilius and E. Pelz. An M-net semantics of B(PN)2 with procedures. ISCIS, vol. 1, 1996.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Franck Pommereau
    • 1
  1. 1.LACLUniversit Paris 12CrteilFrance

Personalised recommendations

Cite chapter

Buy options