Hierarchical graph transformations with meta-rules

  • Authors:

  • Wojciech Palacz

  • Affiliations:

  • Department of Computer Design and Graphics, Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, ul. Reymonta 4, 30-059 Kraków, Poland

  • Venue:
  • Annales UMCS, Informatica
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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