On the syntax and semantics of concurrent computing

  • Maria Zamfir
  • David Martin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 239)


A mathematical model is presented as a common framework within which to discuss and compare different models of concurrent computation. Central to the model is the concept of flow net, which is used to describe concurrent computation, just as a conventional flowchart is used to describe serial computation. A flow-of-control algebra of flow nets is presented by defining a minimal set of operations for composing flow nets, together with an equational system they satisfy. These operations suggest a corresponding minimal syntax — the flow-of-control algebra of flow structures. In this algebra, which is continuous, a flow net is represented by its unfoldment — a finite system of recursion equations. Deadlock and equivalence are examples of properties of concurrent computation formulated in the presented syntax.


Flow Structure Input Node Concurrent System Exit Node Computing Agent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B. Initial Algebra Semantics and Continuous Algebras. Jour. ACM 24(1): 68–95, 1977.Google Scholar
  2. [2]
    Hoare, C.A.R. Communicating Sequential Processes. Comm. ACM21 (8): 666–677, Aug. 1978.Google Scholar
  3. [3]
    Milne, G., and Milner, R. Concurrent Processes and their Syntax. Jour. ACM 26(2): 302–321, April, 1979.Google Scholar
  4. [4]
    Peterson, J.L. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981.Google Scholar
  5. [5]
    Strachey, C., and Wadworth, C.P. Continuations — A Mathematical Semantic Model for Handling Full Jumps. Technical Monograph PRG-11, Programming Research Group, Oxford University, Computing Laboratory, 1974.Google Scholar
  6. [6]
    Thatcher, J.W., Wagner, E.G., and Wright, J.B. Notes on Algebraic Fundamentals for Theoretical Computer Science. In J.B. De Bakker (editor), Foundations of Computer Science, Part 2: Languages, Logic, Semantics. Addison-Wesley, Amsterdam, 1979Google Scholar
  7. [7]
    Wirth, N. MODULA: A language for modular multiprogramming. Res. Rep. 18, Inst. fur Informatik, Zurich, Switzerland, 1975.Google Scholar
  8. [8]
    Zamfir, M. On the Syntax and Semantics of Concurrent Computing. PhD Thesis, UCLA-CSD-820819, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Maria Zamfir
    • 1
  • David Martin
    • 1
  1. 1.Computer Science DepartmentUCLALos Angeles

Personalised recommendations