Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools

@inproceedings{Taentzer2007GenerationOS,
  title={Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools},
  author={G. Taentzer and E. Biermann and D. Bisztray and Bernd Bohnet and Iovka Boneva and A. Boronat and Leif Geiger and Rubino Gei{\ss} and {\'A}. Horv{\'a}th and O. Kniemeyer and T. Mens and Benjamin Ness and D. Plump and T. Vajk},
  booktitle={AGTIVE},
  year={2007}
}
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A Sierpinski triangle shows a well-known fractal structure. This case study is mostly a performance benchmark, involving the construction of all triangles up to a certain number of iterations. Both time and space performance are involved. The transformation rules themselves are quite simple. 
GPaR: A Parallel Graph Rewriting Tool
  • Stéphane Despréaux, A. Maignan
  • Computer Science
  • 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2018
TLDR
GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems and is compared to the performance of other tools on the Sierpinski triangle benchmark. Expand
AGTIVE 2007 Graph Transformation Tool Contest
TLDR
The setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on "Applications of Graph Transformation with Industrial Relevance", are described. Expand
Accretive Computation of Global Transformations of Graphs
TLDR
An algorithm is presented which computes online the global transformation of a finite graph in an accretive manner and a local criterion is given for a rule system to extend to a graph global transformation. Expand
IFSAM: A New Mathematical Technique for Additive Manufacturing based on Iterated Functions System
  • N. Saidou, B. Ferrahi
  • Computer Science
  • 2019 Third International Conference on Intelligent Computing in Data Sciences (ICDS)
  • 2019
TLDR
The model the authors are trying to develop aims to create the equation of cellular structure and to apply the developed technique to a certain multiplicity number to obtain the desired structure. Expand
Repotting the Geraniums: On Nested Graph Transformation Rules
TLDR
A scheme for rule amalgamation based on nested graph predicates that extends all the graphs in such a predicate with right hand sides makes for a smooth, uniform and very powerful amalgamation scheme, which is demonstrated on a number of examples. Expand
D C ] 1 7 M ar 2 02 1 Accretive Computation of Global Transformations of Graphs
The framework of global transformations aims at describing synchronous rewriting systems on a given data structure. In this work we focus on the data structure of graphs. Global transformations ofExpand
A survey and comparison of transformation tools based on the transformation tool contest
TLDR
A survey and a comparison of the model and graph transformation tools that participated at the Transformation Tool Contest 2011 are given and the reader gains an overview of the field and its tools, based on the illustrative solutions submitted to a Hello World task, and a compare alongside a detailed taxonomy. Expand
The Edge of Graph Transformation - Graphs for Behavioural Specification
  • A. Rensink
  • Computer Science
  • Graph Transformations and Model-Driven Engineering
  • 2010
TLDR
A fresh and honest look at why should anyone not already educated in the field adopt graph transformation-based methods, rather than a mainstream modelling language or a process algebra; or vice versa, what is holding potential users back. Expand
Parallel Graph Grammars with Instantiation Rules Allow Efficient Structural Factorization of Virtual Vegetation
TLDR
The computation time for an idealized growing virtual plant, taken from the GreenLab model, in its implementation with instantiation rules in XL, compared to a version without instantiationrules is measured. Expand
Parallel Graph Grammars with Instantiation Rules Allow Efficient Structural Factorization of Virtual Vegetation
TLDR
The computation time for an idealized growing virtual plant, taken from the GreenLab model, in its implementation with instantiation rules in XL, compared to a version without instantiationrules is measured. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 24 REFERENCES
AGTIVE 2007 Graph Transformation Tool Contest
TLDR
The setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on "Applications of Graph Transformation with Industrial Relevance", are described. Expand
Some Essentials of Graph Transformation
Summary. This chapter introduces rule-based graph transformation, which constitutes a well-studied research area in computer science. The chapter presents the most fundamental denitions andExpand
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
TLDR
This work performs first experiments regarding the runtime performance using the well-known GT benchmark introduced by Varro et al. as well as an example from compiler construction and presents an improved cost model and heuristics for search plans and their generation. Expand
GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool
GrGen .NET is a graph rewrite tool enabling elegant and convenient development of graph transformation applications with comparable performance to manually developed ones. GrGen .NET compilesExpand
The Modelling Platform GroIMP and the Programming Language XL
TLDR
The underlying representation of data within GroIMP is a graph, which can be transformed by rules specified in XL, and the system can be used for a lot of other applications. Expand
The GP Programming System
TLDR
The programming system for the graph-transformation GP is described, focusing on the implementation of its compiler and abstract machine, which faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input. Expand
Recent Advances in Formal Languages and Applications
TLDR
Basic Notation and Terminology by Janusz Brzozowski, Hans-Jorg Kreowski, Renate Klempien-Hinrichs, Sabine Kuske, Mitsunori Ogihara, and Friedrich Otto. Expand
Control Flow Support in Metamodel-Based Model Transformation Frameworks
This paper presents the visual control flow support of Visual Modeling and Transformation System (VMTS), which facilitates composing complex model transformations out of simple transformation stepsExpand
Imperative OCL Compiler Support for Model Transformations
Model-Driven Architecture (MDA) is a widely known software design approach, which is intended to support model-driven engineering of software systems with specifications expressed as models. UsingExpand
Eclipse Modeling Framework
The authoritative guide to the Eclipse Modeling Framework (EMF)--written by the lead EMF designers! Shows how EMF unifies three important technologies: Java, XML, and UML @BULLET= Provides aExpand
...
1
2
3
...