On the Formalization and Complexity of Triple Graph Grammars for Model Driven Engineering (bibtex)
by
Abstract:
In Model-Driven Engineering, it is common to describe systems from different perspectives using different models.Therefore, techniques for transforming or synchronizing between these different models are needed. Triple Graph Grammars (TGGs) are a popular technique for the declarative, rule-based specification of model transformations. Being formally based on graphs, TGGs are a potent and flexible technique, which leads to their usability for a high amount of problems, but also to high computational complexity for the individual uses. Thus, when TGGs are to be used in practice, there are two conflicting priorities, namely expressiveness and efficiency. A specific system that is based on TGGs and performs significantly well in terms efficiency is the second version of the Model Transformation Engine (MoTE2). Given the focus on efficiency of recent development, the resulting limitations of expressiveness are, however, neither formally described nor closely analyzed. Therefore, in this work, the MoTE2 algorithm is considered formally. In a first step, a new formalization is introduced which enables the precise descriptions of the TGGs used for MoTE2. Building on this, the restrictions minimally required by MoTE2 are analyzed. Any restrictions that are not absolutely necessary are formulated as parameters, in order to analyze their impact on the runtime complexity of the MoTE2 algorithm in the final part of this work.
Reference:
On the Formalization and Complexity of Triple Graph Grammars for Model Driven Engineering (Christian Zöllner), Master's thesis, Hasso-Plattner-Institut für Digital Engineering, Universität Potsdam, 2017.
Bibtex Entry:
@MastersThesis{Zoellner17,
	AUTHOR = {Zöllner, Christian},
	TITLE = {{On the Formalization and Complexity of Triple Graph Grammars for Model Driven Engineering}},
	YEAR = {2017},
	MONTH = {September},
	SCHOOL = {Hasso-Plattner-Institut für Digital Engineering, Universität Potsdam},
	ABSTRACT = {In Model-Driven Engineering, it is common to describe systems from different perspectives using different models.Therefore, techniques for transforming or synchronizing between these different models are needed. Triple Graph Grammars (TGGs) are a popular technique for the declarative, rule-based specification of model transformations. Being formally based on graphs, TGGs are a potent and flexible technique, which leads to their usability for a high amount of problems, but also to high computational complexity for the individual uses. Thus, when TGGs are to be used in practice, there are two conflicting priorities, namely expressiveness and efficiency. A specific system that is based on TGGs and performs significantly well in terms efficiency is the second version of the Model Transformation Engine (MoTE2). Given the focus on efficiency of recent development, the resulting limitations of expressiveness are, however, neither formally described nor closely analyzed. Therefore, in this work, the MoTE2 algorithm is considered formally. In a first step, a new formalization is introduced which enables the precise descriptions of the TGGs used for MoTE2. Building on this, the restrictions minimally required by MoTE2 are analyzed. Any restrictions that are not absolutely necessary are formulated as parameters, in order to analyze their impact on the runtime complexity of the MoTE2 algorithm in the final part of this work.}
}
Powered by bibtexbrowser