High-level replacement units and their termination properties

  • Authors:

  • Paolo Bottoni;Kathrin Hoffmann;Francesco Parisi Presicce;Gabriele Taentzer

  • Affiliations:

  • University of Rome La Sapienza, Italy;University of Rome La Sapienza, Italy and Technical University, Berlin, Germany;University of Rome La Sapienza, Italy and George Mason University, USA;Technical University, Berlin, Germany

  • Venue:
  • Journal of Visual Languages and Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Visual rewriting techniques, in particular graph transformations, are increasingly used to model transformations of systems specified through diagrammatic sentences. Several rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism; yet, for many of them, basic results concerning the formal properties of these models are still missing. In this paper, we give a contribution towards solving the termination problem for rewriting systems with external control mechanisms. In particular, we obtain results of more general validity by extending the concept of transformation unit to high-level replacement systems, a generalization of graph transformation systems. For high-level replacement units, we state and prove several abstract properties based on termination criteria. Then, we instantiate the high-level replacement systems by attributed graph transformation systems and present concrete termination criteria. We explore some types of rules and replacement units for which the criterion can be established. These are used to show the termination of some replacement units needed to express model transformations formalizing refactoring.