Towards Local Confluence Analysis for Amalgamated Graph Transformation

  • 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.

Export metadata

  • Export Bibtex
Metadaten
Author:Gabriele Taentzer, Ulrike Golas
Editor:F. Parisi-Presicce, B. Westfechtel
Document Type:In Proceedings
Parent Title (English):Graph Transformations. Proceedings of ICGT 2015
Volume:9151
First Page:69
Last Page:86
Series:Lecture Notes in Computer Science
Publisher:Springer
Year of first publication:2015
Preprint:urn:nbn:de:0297-zib-54943
DOI:http://dx.doi.org/10.1007/978-3-319-21145-9_5

$Rev: 13581 $