Hostname: page-component-6bf8c574d5-gr6zb Total loading time: 0 Render date: 2025-02-21T04:12:12.344Z Has data issue: false hasContentIssue false
  • English
  • Français

Abstract hierarchical graph transformation

Published online by Cambridge University Press:  15 July 2005

GIORGIO BUSATTO ,
HANS-JÖRG KREOWSKI  and
SABINE KUSKE
GIORGIO BUSATTO
Affiliation:
Carl v. Ossietzky Universität, Fachbereich Informatik, 26111 Oldenburg Email: giorgio.busatto@informatik.uni-oldenburg.de
HANS-JÖRG KREOWSKI
Affiliation:
University of Bremen, Department of Computer Science, P.O. Box 330440 D-28334 Bremen Email: kreo@informatik.uni-bremen.de, kuske@informatik.uni-bremen.de
SABINE KUSKE
Affiliation:
University of Bremen, Department of Computer Science, P.O. Box 330440 D-28334 Bremen Email: kreo@informatik.uni-bremen.de, kuske@informatik.uni-bremen.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and, likewise, edges) into a hierarchy of packages. In contrast to other known approaches, we do not fix the type of underlying graphs. Moreover, our model is equipped with a rule-based transformation concept such that hierarchical graphs are not restricted to being used only for the static representation of complex system states, but can also be used to describe dynamic system behaviour.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 15 , Issue 4 , August 2005 , pp. 773 - 819
Copyright
2005 Cambridge University Press

Footnotes

This work was partially supported by the ESPRIT Working Group Application of Graph Transformation (APPLIGRAPH) and the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS).