ESM systems and the composition of their computations

  • D. Janssens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 776)


ESM systems are graph rewriting systems where productions are morphisms in a suitable category, ESM. The way graphs are transformed in ESM systems is essentially the same as in actor grammars, which were introduced in [JR]. It is demonstrated that a rewriting step corresponds to a (single) pushout construction, as in the approach from


Actor Production Computation Structure Graph Transformation Sequential Composition Initial Graph 
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. [H]
    C. Hewitt, Viewing Control Structures as Patterns of Passing Messages, J. Artificial Intel., 8 (1977), 323–364.CrossRefGoogle Scholar
  2. [HB]
    C. Hewitt and H. Baker, Laws for Communicating Parallel Processes, Proc. IFIP 77, Toronto, 1977, 987–992.Google Scholar
  3. [J]
    D. Janssens, Equivalence of Computations in Actor Grammars, Theoretical Computer Science, 109 (1993), 145–180.Google Scholar
  4. [JLR]
    D. Janssens, M.Lens and G. Rozenberg, Computation Graphs for Actor Grammars, Journal of Computer and System Sciences, 46 (1993), 60–90.Google Scholar
  5. [JR]
    D. Janssens and G. Rozenberg, Actor Grammars, Math. Systems Theory, 22 (1989), 75–107.Google Scholar
  6. [L]
    M. Löwe, Algebraic Approach to Single-Pushout Graph Transformation, Theoretical Computer Science, 109 (1993). 181–224.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • D. Janssens
    • 1
  1. 1.Dept. of Computer scienceFree University of Brussels (VUB)Belgium

Personalised recommendations