Abstract
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
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Hewitt, Viewing Control Structures as Patterns of Passing Messages, J. Artificial Intel., 8 (1977), 323–364.
C. Hewitt and H. Baker, Laws for Communicating Parallel Processes, Proc. IFIP 77, Toronto, 1977, 987–992.
D. Janssens, Equivalence of Computations in Actor Grammars, Theoretical Computer Science, 109 (1993), 145–180.
D. Janssens, M.Lens and G. Rozenberg, Computation Graphs for Actor Grammars, Journal of Computer and System Sciences, 46 (1993), 60–90.
D. Janssens and G. Rozenberg, Actor Grammars, Math. Systems Theory, 22 (1989), 75–107.
M. Löwe, Algebraic Approach to Single-Pushout Graph Transformation, Theoretical Computer Science, 109 (1993). 181–224.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janssens, D. (1994). ESM systems and the composition of their computations. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-57787-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57787-4
Online ISBN: 978-3-540-48333-5
eBook Packages: Springer Book Archive