More on Graph Rewriting With Contextual Refinement

In GRGEN , a graph rewrite generator tool, rules have the outstanding feature that variables in their pattern and replacement graphs may be refined with meta-rules based on contextual hyperedge replacement grammars. A refined rule may delete, copy, and transform subgraphs of unbounded size and of variable shape. In this paper, we show that rules with contextual refinement can be transformed to stan- dard graph rewrite rules that perform the refinement incrementally, and are applied according to a strategy called residual rewriting. With this transformation, it is possi- ble to state precisely whether refinements can be determined in finitely many steps or not, and whether refinements are unique for every form of refined pattern or not.

[1]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[2]  Annegret Habel,et al.  Graph Unification and Matching , 1994, TAGT.

[3]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[4]  Hartmut Ehrig,et al.  ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence , 2012, Fundam. Informaticae.

[5]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[6]  Berthold Hoffmann,et al.  Shapely hierarchical graph transformation , 2001, Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587).

[7]  Martin Fowler,et al.  Refactoring - Improving the Design of Existing Code , 1999, Addison Wesley object technology series.

[8]  Berthold Hoffmann,et al.  Defining Models - Meta Models versus Graph Grammars , 2010, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[9]  Tom Mens,et al.  Formalizing refactorings with graph transformations , 2005, J. Softw. Maintenance Res. Pract..

[10]  Dirk Janssens,et al.  A Hierarchical Program Representation for Refactoring , 2003, Electron. Notes Theor. Comput. Sci..

[11]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[12]  Annegret Habel,et al.  Double-pushout graph transformation revisited , 2001, Mathematical Structures in Computer Science.

[13]  Annegret Habel,et al.  Expressiveness of graph conditions with variables , 2010, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[14]  Berthold Hoffmann,et al.  Graph Rewriting with Contextual Refinement , 2013, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[15]  Detlef Plump,et al.  Hypergraph rewriting: critical pairs and undecidability of confluence , 1993 .

[16]  Hartmut Ehrig,et al.  Cospan DPO Approach: An Alternative for DPO Graph Transformations , 2009, Bull. EATCS.

[17]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[18]  Grzegorz Rozenberg,et al.  Graph grammars with node-label controlled rewriting and embedding , 1982, Graph-Grammars and Their Application to Computer Science.

[19]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[20]  Berthold Hoffmann,et al.  Contextual Hyperedge Replacement , 2011, AGTIVE.

[21]  T. Uesu.  A system of graph grammars which generates all recursively enumerable sets of labelled graphs , 1978 .

[22]  Hartmut Ehrig,et al.  Local Confluence for Rules with Nested Application Conditions , 2010, ICGT.

[23]  Arend Rensink.  The GROOVE Simulator: A Tool for State Space Generation , 2003, AGTIVE.

[24]  Gabriele Taentzer,et al.  The AGG approach: language and environment , 1999 .