%0 Journal Article
%T Hierarchical graph transformations with meta-rules
%A Wojciech Palacz
%J Annales UMCS, Informatica
%@ 2083-3628
%D 2008
%I 
%R 10.2478/v10065-008-0002-8
%X This paper is concerned with hierarchical graph models and graph transformation rules, specifically with the problem of transforming a part of graph which may contain subordinated nodes and edges. Meta-rules are proposed as a formal way of representing transformations which remove or duplicate a node along with its contents. The paper discusses the behavior of meta-rules when applied to different types of hierarchical graphs, possible failure cases, and concludes by introducing a type of hierarchical graphs in which meta-rules can always be successfully expanded.
%U http://versita.metapress.com/content/027r816x04804114/?p=aa4989818889414a830fe8c8322e81f4&pi=1