Formal Languages
Meta Modeling and Graph Grammars: Integration of two Paradigms for the Definition of Visual Modeling Languages
On this page:
 Meta Modeling and Graph Grammars: Integration of two Paradigms for the Definition of Visual Modeling Languages
 References
1 Meta Modeling and Graph Grammars: Integration of two Paradigms for the Definition of Visual Modeling Languages
Projekt duration: 3 years
Funded by: Deutsche Forschungsgemeinschaft (DFG)
Summary:

Visual modeling languages play an important role for the understanding and construction of systems. This is true for hard and software systems in computer science as well as other systems such as production systems. In modeldriven software engineering, models are even treated as the central artifacts of software development. According to the goal of modeling, different modeling languages are needed, general and domainspecific ones as well as visual and textual ones. In this project, we focus on two complementary approaches to define visual modeling languages: metamodeling and graph grammars. While metamodeling represents a declarative language design, graph grammars define languages in a constructive way. To use the advantages of both paradigms, we aim to integrate them in a suitable way. Metamodels should be translated into equivalent model grammars, enabling a wellfounded automated generation of instance models. As formal basis of this work we use the theory of algebraic graph transformation. This metamodel translation shall be used for the development of userfriendly model editors as well as for the systematic testing of model transformations. The newlydeveloped techniques shall be implemented based on the Eclipse Modeling Project and evaluated at two reference applications.
2 References
2.1 Journal publications
 [Rad13]
 Hendrik Radke. HR^{*} graph conditions between counting monadic secondorder and secondorder graph formulas. Electronic Communications of the EASST, 61, 2013. Link.
 [Tae12]
 Gabriele Taentzer. Instance generation from type graphs with arbitrary multiplicities. Electronic Communications of the EASST, 47, 2012.
2.2 Inproceedings & Incollections
 [RAB^{+}15]
 Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, and Grabriele Taentzer. Translating essential ocl invariants to nested graph constraints focusing on set operations. In Graph Transformations (ICGT 2015), volume 9151 of Lecture Notes in Computer Science, pages 155170, 2015. [ long version ].
 [AHRT14]
 Thorsten Arendt, Annegret Habel, Hendrik Radke, and Gabriele Taentzer. From core OCL invariants to nested graph constraints. In Graph Transformations (ICGT 2014), Lecture Notes in Computer Science, 2014. [ .pdf ] [ long version ] [ Springer Link ].
2.3 Further publications