Hierarchical Graph Transformation †
نویسندگان
چکیده
Hierarchical Graph Transformation Gio r g i o Bu s a t t o Carl v. Ossietzky Universität Fachbereich Informatik 26111 Oldenburg email: [email protected] Han s J ö r g K r e ow sk i, S ab i n e Ku sk e University of Bremen Department of Computer Science P.O. Box 330440 D-28334 Bremen email: {kreo,kuske}@informatik.uni-bremen.de
منابع مشابه
Parallel Independence in Hierarchical Graph Transformation
Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...
متن کاملShapely Hierarchical Graph Transformation
Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles t...
متن کاملHierarchical Graph Transformation
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملA Framework for Adding Packages to Graph Transformation Approaches
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically structured graphs. But, while there already exist hierarchical graph data models, no generalpurpose hierarchical graph data model exists yet, which unifies common features of these domain-specific models. In this paper, we...
متن کاملIncremental Construction of Millstream Configurations Using Graph Transformation
Millstream systems are a non-hierarchical model of natural language. We describe an incremental method for building Millstream configurations while reading a sentence. This method is based on a lexicon associating words and graph transformation rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005