Shapely hierarchical graph transformation

Author

Hoffmann, Berthold

Author_Institution

Technologiezentrum Informatik, Bremen Univ., Germany

fYear

2001

fDate

2001

Firstpage

30

Lastpage

37

Abstract

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 term rewriting. · We require that admissable shapes for hierarchical graphs are specified by context free graph grammars, in order to set up a type discipline for shapely hierarchical graph transformation. The resulting computational model shall be the basis of the visual language DIAPLAN for programming with graphs that represent diagrams

Keywords

graph grammars; rewriting systems; visual languages; DIAPLAN; computational model; context free grammars; graph grammars; graph transformation; graphs; programming with graphs; term rewriting; visual language; Computational modeling; Computer science; Labeling; Shape; Unified modeling language; Vocabulary;

fLanguage

English

Publisher

ieee

Conference_Titel

Human-Centric Computing Languages and Environments, 2001. Proceedings IEEE Symposia on

Conference_Location

Stresa

Print_ISBN

0-7803-7198-4

Type

conf

DOI

10.1109/HCC.2001.995230

Filename

995230