Programmed graph replacement systems
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
An Overview of the GXL Graph Exchange Language
Revised Lectures on Software Visualization, International Seminar
VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Model-Driven Development of Model Transformations
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Transformation Language Integration Based on Profiles and Higher Order Transformations
Software Language Engineering
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
| Hi-index | 0.00 |
GTXL (Graph Transformation Exchange Language) is designed to support and stimulate developers to provide their graph transformation-based tools with an exchange functionality regarding the integration with other tools. For this exchange XML was chosen as underlying technology. The exchange of graphs is facilitated by the exchange format GXL which is also XML-based. GTXL uses GXL to describe the graph parts of a graph transformation system. A first version of GTXL arose from the format discussion within the EU Working Group APPLIGRAPH. Trying to restimulate the discussion on a common exchange format for graph transformation systems, this paper presents a new version of GTXL. Three important changes have been made. At first, an integrated presentation of rules is introduced, secondly the expression of more general conditions is supported and finally the storage of the underlying semantics of a graph transformation system by means of special attributes is proposed.