A fifo-net model for processes with asynchronous communication

  • J. Fanchon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 609)


We define net-based formal models for concurrent processes communicating by asynchronous message passing. Programs specified in an abstract language are modelled by fifo-nets with composition operators, and for the first time extended compositionality and partial order semantics are considered in the fifo-net context. This leads to an algebra of fifo-nets, together with different congruences, which extends to the asynchronous communication part of the work on CCS, TCSP and ACP.


Concurrent processes asynchronous communication fifo-nets algebra partial order semantics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BKT]
    J.A. Bergstra, J.W. Klop, J.V. Tucker, Process algebra with asynchronous communication mechanism, Seminar on concurrency, LNCS 197(1985).Google Scholar
  2. [Bes1]
    E. Best, Concurrent behaviours: sequences, processes and axioms, LNCS 255 (1987).Google Scholar
  3. [Bes2]
    E. Best, COSY: its relationship to Nets and CSP, LNCS 197 (1986).Google Scholar
  4. [BZ]
    D.Brand,P.Zafiropoulos, On Communicating Finite-state Machines, JACM vol nℴ2, April 1983.Google Scholar
  5. [BoCa]
    G. Boudol, I. Castellani, Concurrency and Atomicity, Theoretical Computer Science 59 (1988), pp. 25–84Google Scholar
  6. [DDM]
    P.Degano, R.De Nicola, U.Montanari, A distributed operational semantics for CCS based on C/E systems, Acta Informatica, 26, 1988.Google Scholar
  7. [Fan]
    J. Fanchon, An Algebra of Fifo-Nets, RR LRI, to appear.Google Scholar
  8. [FiMe]
    A.Finkel, G.Memmi, Fifo nets: a new model of parallel computation, Proc. 6th conf. on Theor. Comp. Sci., LNCS 145, 1983.Google Scholar
  9. [GlVa]
    R.van Glabeek, F. Vaandrager, Petri nets models for algebraic theories of concurrency, LNCS 259 (1987) 224–242.Google Scholar
  10. [Gol]
    U. Goltz, CCS and Petri Nets, LNCS 469, 1990.Google Scholar
  11. [GoRo]
    M.G. Gouda, L.E. Rosier, Priority networks of communicating finite state machines, SIAM J.Comput. Vol. 14, nℴ3 (1985).Google Scholar
  12. [Gra]
    J. Grabowski, On partial languages, Fundamenta Informaticae IV. 2, 1981.Google Scholar
  13. [Ki]
    A.Kiehn, Local and Global Causes, TUM research report nℴ 342/23/91 A, August 1991.Google Scholar
  14. [Maz]
    A. Mazurkiewicz, Trace theory, LNCS 255 (1986).Google Scholar
  15. [Mil]
    R. Milner, Lectures on a Calculus for Communicating Systems, Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220Google Scholar
  16. [Pom]
    L.Pomello, Some equivalence notions for concurrent systems, LNCS 222 (1986).Google Scholar
  17. [Pra]
    V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • J. Fanchon
    • 1
  1. 1.Laboratoire de Recherche en Informatique CNRS UA 410 Bat. 490Université Paris-SudOrsay CedexFrance

Personalised recommendations