Shapely Hierarchical Graph Transformation

Authors:
Berthold Hoffmann
Affiliations:
-
Venue:
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Year:
2001

Citing 0
Cited 11

Hierarchical graph transformation

Journal of Computer and System Sciences
Gamma and the Chemical Reaction Model: Fifteen Years After

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Abstraction and Control for Shapely Nested Graph Transformation

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Context-exploiting shapes for diagram transformation

Machine Graphics & Vision International Journal - Special issue on diagrammatics & Design
Abstraction and control for shapely nested graph transformation

Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
Shaped Generic Graph Transformation

Applications of Graph Transformations with Industrial Relevance
The Chemical Reaction Model Recent Developments and Prospects

Software-Intensive Systems and New Computing Paradigms
Rule-Based Programming with Diaplan

Electronic Notes in Theoretical Computer Science (ENTCS)
Graph transformation with variables

Formal Methods in Software and Systems Modeling
Abstraction and Control for Shapely Nested Graph Transformation

Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
Contextual hyperedge replacement

AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance

Quantified Score

Hi-index	0.00

Visualization

Abstract

Diagrams can be represented by graphs, and the animationand transformation of diagrams can be modeledby graph transformation. This paper studies extensionsof graphs and graph transformation that are important forprogramming with graphs:\bullet We extend graphs by a notion of hierarchy that supportsvalue composition, and define hierarchical graphtransformation in an intuitive way that resembles termrewriting.\bullet We require that admissable shapes for hierarchicalgraphs are specified by context-free graph grammars,in order to set up a type discipline for shapely hierarchicalgraph transformation.The resulting computational model shall be the basis of thevisual language DIAPLAN for programming with graphsthat represent diagrams.