An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations (bibtex)
by Born, Kristopher and Taentzer, Gabriele
Abstract:
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 forming an interaction scheme.
Reference:
An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations (Born, Kristopher and Taentzer, Gabriele), In Graph Transformation (Echahed, Rachid, Minas, Mark, eds.), Springer International Publishing, 2016.
Bibtex Entry:
@InProceedings{Born2016,
  author        = {Born, Kristopher and Taentzer, Gabriele},
  title         = {{An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations}},
  booktitle     = {Graph Transformation},
  year          = {2016},
  editor        = {Echahed, Rachid and Minas, Mark},
  pages         = {118--134},
  address       = {Cham},
  publisher     = {Springer International Publishing},
  __markedentry = {[piets:1]},
  abstract      = {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 forming an interaction scheme.},
  isbn          = {978-3-319-40530-8},
}
Powered by bibtexbrowser