In the present paper we generalize the well-known PARALLELISM THEOREM for graph derivations to the AMALGAMATION THEOREM. In this theorem the assumption of ‘parallel independence’ is dropped. For each pair of productions together with a relational production (allowing productions to be associated with each other) we construct a single ‘amalgamated’ production. The AMALGAMATION THEOREM states that graph derivations which respect the given associations can be amalgamated to a single derivation via the ‘amalgamated’ production. The amalgamation mechanism can be used to handle synchronization phenomena. The amalgamation concept is applied to synchronization of graph manipulations in a simplified railway control system as well as in GDS, a graph grammar formalism for distributed systems.
CITATION STYLE
Boehm, P., Fonio, H. R., & Habel, A. (1985). Amalgamation of graph transformations with applications to synchronization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 185 LNCS, pp. 267–283). Springer Verlag. https://doi.org/10.1007/3-540-15198-2_17
Mendeley helps you to discover research relevant for your work.