ESM Systems and the Composition of Their Computations

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

[1]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[2]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[3]  Dirk Janssens,et al.  Equivalence of Computations in Actor Grammars , 1993, Theor. Comput. Sci..

[4]  Carl Hewitt,et al.  Laws for Communicating Parallel Processes , 1977, IFIP Congress.

[5]  Grzegorz Rozenberg,et al.  Computation Graphs for Actor Grammars , 1993, J. Comput. Syst. Sci..