A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations
[chapter]

2016
*
Lecture Notes in Computer Science
*

Graph transformation has been shown to be well suited as formal foundation for model transformations. While simple model changes may be specified by simple transformation rules, this is usually not sufficient for more complex changes. In these situations, the concept of amalgamated transformation has been increasingly often used to model for each loops of rule applications which coincide in common core actions. Such a loop can be specified by a kernel rule and a set of extending multi-rules

doi:10.1007/978-3-319-40530-8_8
fatcat:i4fgnlp3pfachcy2z3vy5rzufu