@book{EhrigErmelGolasetal., author = {Ehrig, Hartmut and Ermel, Claudia and Golas, Ulrike and Hermann, Frank}, title = {Graph and Model Transformation}, publisher = {Springer-Verlag Berlin Heidelberg}, isbn = {978-3-662-47979-7}, doi = {10.1007/978-3-662-47980-3}, abstract = {This book is a comprehensive explanation of graph and model transformation. It contains a detailed introduction, including basic results and applications of the algebraic theory of graph transformations, and references to the historical context. Then in the main part the book contains detailed chapters on M-adhesive categories, M-adhesive transformation systems, and multi-amalgamated transformations, and model transformation based on triple graph grammars. In the final part of the book the authors examine application of the techniques in various domains, including chapters on case studies and tool support. The book will be of interest to researchers and practitioners in the areas of theoretical computer science, software engineering, concurrent and distributed systems, and visual modelling.}, language = {en} } @inproceedings{TaentzerGolas, author = {Taentzer, Gabriele and Golas, Ulrike}, title = {Towards Local Confluence Analysis for Amalgamated Graph Transformation}, series = {Graph Transformations. Proceedings of ICGT 2015}, volume = {9151}, booktitle = {Graph Transformations. Proceedings of ICGT 2015}, editor = {Parisi-Presicce, F. and Westfechtel, B.}, publisher = {Springer}, doi = {10.1007/978-3-319-21145-9_5}, pages = {69 -- 86}, abstract = {Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analysis (CPA) can be used to show local confluence of graph transformation systems. It is an open challenge to lift the CPA to amalgamated graph transformation systems, especially since infinite many pairs of amalgamated rules occur in general. As a first step towards an efficient local confluence analysis of amalgamated graph transformation systems, we show that the analysis of a finite set of critical pairs suffices to prove local confluence.}, language = {en} } @misc{TaentzerGolas, author = {Taentzer, Gabriele and Golas, Ulrike}, title = {Local Confluence Analysis for Amalgamated Graph Transformation: Long Version}, issn = {1438-0064}, doi = {10.1007/978-3-319-21145-9_5}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-54943}, abstract = {Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analysis (CPA) can be used to show local confluence of graph transformation systems. It is an open challenge to lift the CPA to amalgamated graph transformation systems, especially since infinite many pairs of amalgamated rules occur in general. As a first step towards an efficient local confluence analysis of amalgamated graph transformation systems, we show that the analysis of a finite set of critical pairs suffices to prove local confluence.}, language = {en} }