@incollection{EBE02,
Title = {{Generation of Animation Views for Petri Nets in \textsc{GenGED}}},
Author = {Ermel, C. and Bardohl, R. and Ehrig, H.},
Booktitle = {{Advances in Petri Nets: Petri Net Technology for Communication Based Systems}},
Year = {2003},
Abstract = {Formal specification techniques like Petri nets allow the formal description and analysis of systems. In this paper, we develop a formal approach for the generic specification of animation views for different Petri net classes based on GenGED and graph transformation. The GenGED approach, developed at the TU Berlin, allows the generic description of visual modeling languages such as different Petri net classes. In our framework, the animation view of a system modeled as a Petri net consists of a domain-specific layout and an animation according to the firing behavior of the Petri net class. The basic idea is to generate visual animation rules based on visual syntax rules defining the corresponding Petri net language. We propose a view transformation from the classical Petri net layout to the animation layout.},
Url = {http://user.tu-berlin.de/lieske/tfs/publikationen/Papers02/EBE02.pdf},
Keywords = {Petri Nets, Animation, GenGED, Visual Languages, Animation View}
}
@incollection{ETB05,
Title = {{Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation}},
Author = {Ermel, C. and Taentzer, G. and Bardohl, R.},
Booktitle = {{Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday}},
Year = {2005},
Abstract = {The ``classical'' approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic High-Level (AHL) nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/ETB05.pdf},
Keywords = {parallel graph transformation, algebraic high-level nets, Petri net semantics}
}
@inproceedings{BEE00,
Title = {{Generic Description, Behavior and Animation of Visual Modeling Languages}},
Author = {Bardohl,R. and Ehrig,H. and Ermel,C.},
Booktitle = {Proc. Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Address = {Dallas (Texas), USA},
Month = {June},
Keyy = {BEE00}
}
@inproceedings{BEE+02,
Title = {{\textsc{GenGEd} -- Specifying Visual Environments based on Visual Languages}},
Author = {Bardohl, R. and Ehrig, K. and Ermel, C. and Qemali, A. and Weinhold, I.},
Booktitle = {Proc. of APPLIGRAPH Workshop on Applied Graph Transformation (AGT 2002)},
Pages = {71--82},
Year = {2002},
Editor = {Kreowski, H.-J.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/AGT02.pdf},
Keywords = {Graph Transformation, Visual Modeling, GenGED}
}
@inproceedings{BE01a,
Title = {{Visual Specification and Parsing of a Statechart Variant using \textsc{GenGEd}}},
Author = {Bardohl,R. and Ermel,C.},
Booktitle = {Statechart Modeling Contest at IEEE Symposium on Visual Languages and Formal Methods (VLFM'01)},
Year = {2001},
Address = {Stresa, Italy},
Month = {September 5--7},
Url = {http://www2.informatik.uni-erlangen.de/VLFM01/Statecharts/}
}
@techreport{BEE01,
Title = {{Generic Description of Syntax, Behavior and Animation of Visual Models}},
Author = {Bardohl, R. and Ermel, C. and Ehrig, H.},
Year = {2001},
Issn = {ISSN 1436-9915},
Number = {2001/19},
Institution = {Technische Universit\"at Berlin},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/TR-2001-19.ps.gz},
Keywords = {Visual Modeling, Graph Transformation, Petri Nets, Simulation, Animation}
}
@inproceedings{BEP02b,
Title = {{Transforming Specification Architectures by \textsc{GenGED}}},
Author = {Bardohl, R. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. First Int. Conference on Graph Transformation (ICGT'02)},
Pages = {30-44},
Year = {2002},
Issn = {ISSN 0302-9743, ISBN 3-540-44310-X},
Address = {Barcelona, Spain},
Volume = {2505},
Month = {October},
Editor = {Corradini, A. and Ehrig, H. and Kreowski, H.-J. and Rozenberg, G.},
Abstract = {This contribution concerns transformations of specification architectures which are diagrams of sub-specifications. The graph of a diagram presents the architecture: the nodes correspond to the sub-specifications and the edges to specification morphisms. We do not fix a specific visual specification technique, so this approach is in the tradition of high-level replacement systems. We discuss how to transform such specification architectures and distinguish local and global changes. The main emphasis of this contribution is the specification and transformation of specification architectures using \GenGEDp. In GenGED, a visual language (VL) is defined by a visual alphabet and a visual syntax grammar. We define a VL for specification architectures by composing VLs for graphs and for P/T nets enhanced by Petri net morphisms. From this VL definition a syntax-directed editor is generated supporting the editing of consistent specification architectures. Local and global changes of a specific specification architecture then can easily be defined as transformation rules in our VL and visualized in the GenGED environment.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEP02b.pdf},
Keywords = {Graph Transformation, GenGED, Petri nets, Architecture Description}
}
@inproceedings{BEP02a,
Title = {{Formal Relationship between Petri Nets and Graph Grammars as Basis for Animation Views in GenGED}},
Author = {Bardohl, R. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. IDPT 2002: Sixth World Conference on Integrated Design and Process Technology},
Year = {2002},
Publisher = {Society for Design and Process Science (SDPS)},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEP02a.pdf},
Keywords = {Graph Transformation, Petri Nets, Semantical Compatibility, Visual Modeling, Animation View, GenGED}
}
@inproceedings{BER00a,
Title = {Towards {V}isual {S}pecification and {A}nimation of {P}etri {N}et {B}ased {M}odels},
Author = {Bardohl,R. and Ermel,C. and Ribeiro,L.},
Booktitle = {Proc. GRATRA 2000 - Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems},
Pages = {22--31},
Year = {2000},
Month = {March},
Publisher = {Technische Universit\"at Berlin},
Keyy = {BER00a}
}
@inproceedings{BER00b,
Title = {A {M}odular {A}pproch to {A}nimation of {S}imulation {M}odels},
Author = {Bardohl,R. and Ermel,C. and Ribeiro,L.},
Booktitle = {Proc. 14$^{th}$ Brazilian Symposium on Software Engineering},
Year = {2000},
Address = {Joao Pessoa, Brazil},
Month = {October},
Keyy = {BER00b}
}
@inproceedings{BEW02b,
Title = {{\textsc{Agg} and \textsc{GenGED}: Graph Transformation-Based Analysis Techniques for Efficient Visual Language Validation}},
Author = {Bardohl, R. and Ermel, C. and Weinhold, I.},
Booktitle = {Proc. Graph Transformation-Based Tools (GraBaTs'02), Satellite Event of ICGT'02},
Pages = {120-130},
Year = {2002},
Issn = {ISBN: 0444513124},
Address = {Barcelona, Spain},
Month = {October},
Editor = {Mens, T. and Sch\"urr, A. and Taentzer, G.},
Abstract = {GenGED supports the visual specification of visual languages (VLs), each specification configures the specific VL environment. The main component available in a VL environment is an editor providing either syntax-directed or free-hand editing. In the latter case, a user-defined diagram has to be analyzed according to a parse grammar. The structure of such a parse grammar is given as a Layered Graph Grammar (LGG) that is realized by the integrated Agg system for the transformation of diagrams' abstract syntax. As we show in this paper, LGGs increase the expressiveness of VL specifications and guarantee termination of the parsing process. Moreover, in order to make parsing efficient, critical pair analysis is implemented by Agg. The parsing process is explained along the specification of a variant of the well-known statechart language.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEW02.pdf},
Keywords = {Graph Transformation, Tool, Visual Languages, AGG, GenGED}
}
@inproceedings{BEW03,
Title = {{GenGED - A Visual Definition Tool for Visual Modeling Environments}},
Author = {Bardohl, R. and Ermel, C. and Weinhold, I.},
Booktitle = {Proc. Application of Graph Transformations with Industrial Relevance (AGTIVE'03)},
Year = {2004},
Address = {Charlottesville/Virgina, USA},
Volume = {3062},
Editor = {Pfaltz, J. and Nagl, M.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {In this paper, we present the current version of GenGED allowing the visual definition and generation of visual modeling environments including editors, parsers, and simulators. All kinds of manipulations are based on algebraic graph transformation and graphical constraint solving techniques. XML-based storing facilities offer the basis for further processing by external tools, e.g. model checkers.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers03/BEW03.pdf},
Keywords = {Graph Transformation, Visual Modeling Environment, Visual Languages}
}
@techreport{BEW02,
Title = {{Specification and Analysis Techniques for Visual Languages with \textsc{GenGED}}},
Author = {Bardohl,R. and Ermel,C. and Weinhold,I.},
Year = {2002},
Issn = {ISSN 1436-9915},
Number = {2002--13},
Month = {September},
Institution = {Technical University Berlin, Dept. of Computer Science},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2002/TR_02_13.ps.gz},
Keywords = {Graph Transformation, Tool, Visual Languages, Analysis, GenGED}
}
@article{BDE+07,
Title = {{M}odel {T}ransformations {S}hould be {F}unctors},
Author = {Batory, D. and Diaz, O. and Ehrig, H. and Ermel, C. and Prange, U. and Taentzer, G.},
Pages = {75--81},
Year = {2007},
Isbn = {ISSN 0252-9742},
Volume = {92},
Abstract = {The concept of model transformations is of increasing importance in different areas of Computer Science, but up to now, there is a lack of common understanding concerning the mathematical and practical point of view. In this paper, we discuss some of the different aspects. Especially interesting is the new proposal of the POPL�07 keynote speaker Don Batory claiming that model transformations should be functors. This claim is compared with different mathematical concepts of model transformation.},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin},
Keywords = {model transformation, category theory}
}
@inproceedings{BCE+07,
Title = {{Extending GMF: Generating Domain-Specific Model Editors with Complex Editing Commands}},
Author = {Biermann, E. and Crema, A. and Ehrig, K. and Ermel, C. and K\"ohler, C. and Schmutzler, R. and Taentzer, G.},
Booktitle = {Proc. Eclipse Summit Europe 2007},
Year = {2007},
Address = {Ludwigsburg, Germany},
Month = {October},
Abstract = {GMF-generated editors offer basic editing commands to create, edit, move and delete single model elements (basic editing). Graph transformation-based editors (see e.g. Tiger) show that the generation of editors with complex editing commands is also possible. Editing e.g. activity diagrams, there might be editing commands available which insert or delete a complete decision structure in one step. In this paper, we describe how meta model-based editor design and generation performed by GMF [3], can be extended by graph transformation concepts to define and generate complex editing commands to be used in GMF-generated visual editors.},
Url = {http://www.eclipsecon.org/summiteurope2007/presentations/ESE2007_Model-Biermann-ExtendingGMF.pdf},
Keywords = {Eclipse, GMF, complex editing commands, graph transformation, EMF transformation}
}
@incollection{BEE+10,
Title = {Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation},
Author = {Biermann, E. and Ehrig, H. and Ermel, C. and Golas, U. and Taentzer, G.},
Booktitle = {Graph Transformations and Model-Driven Engineering. Essays Dedicated to Manfred Nagl},
Pages = {121--140},
Year = {2010},
Isbn = {ISSN 0302-9743},
Volume = {5765},
Editor = {Engels, G. and Lewerentz, C. and Sch\"afer, W. and Sch\"urr, A. and Westfechtel, B.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {The theory of algebraic graph transformation has proven to be a suitable underlying formal framework to reason about the behavior of model transformations. In order to model an arbitrary number of actions at different places in the same model, the concept of amalgamated graph transformation has been proposed. Rule applications of certain regularity are described by a rule scheme which contains multirules modeling elementary actions and a common kernel rule for their synchronization (amalgamation). The amalgamation theorem by B\"ohm et al. ensures that for two multi-rules, the application of the amalgamated rule yields the same result as two iterative rule applications, respecting their common kernel rule application. In this paper, we propose an extension of the amalgamation theorem to an arbitrary finite number of synchronous rule applications. The theorem is used to show parallel independence of amalgamated graph transformations by analyzing the underlying multi-rules. As example, we specify an excerpt of a model transformation from Business Process Models (BPM) to the Business Process Execution Language (BPEL).},
Url = {http://www.springerlink.com/content/q7t7463205128n75/}
}
@inproceedings{BEE+09,
Title = {{Modeling Multicasting in Dynamic Communication-based Systems by Reconfigurable High-level Petri Nets}},
Author = {Enrico Biermann and Hartmut Ehrig and Claudia Ermel and Kathrin Hoffmann and Tony Modica},
Booktitle = {IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2009, Corvallis, OR, USA, 20-24 September 2009, Proceedings},
Pages = {47-50},
Year = {2009},
Location = {Corvallis, Oregon, USA},
Publisher = {IEEE},
Abstract = {In mobile and adaptive communication systems, communicating entities (actors) can transmit content (via channels), which is contextually interpreted. Actors may join, move in or leave so-called communication spaces, where the actors' preferences, access rights and roles are respected and define a temporary set of communicating partners and a context of interpretation for communicated data. An adequate modeling technique for such dynamic communication-based systems (DCS) should take into account the changing communication relations between DCS actors. Conventional modeling techniques for communicationbased systems like Petri nets or UML are restricted to model communication based on a static, immutable network topology. In our research project �Formal modeling and analysis of flexible processes in mobile ad-hoc networks�, we have proposed an appropriate integration of Petri nets and Petri net transformation rules, based on graph transformation (reconfigurable Petri nets). In this paper, we extend this previous work on reconfigurable Petri nets on the one hand by marking-changing Petri net transformations, and on the other hand by a technique parallelizing the application of net transformation rules at several matches at once. Both extensions together allow for a flexible modeling of communication concepts in DCS, like e.g. multicasting, where one actor transmits contents to a group of selected actors. We apply our extended technique to model multicasting group communication.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/BEE+09.pdf}
}
@inproceedings{BEEH08,
Title = {{Flexible Visualization of Automatic Simulation based on Structured Graph Transformation}},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL-HCC'08)},
Pages = {21-29},
Year = {2008},
Isbn = {978-1-4244-2528-0},
Location = {Herrsching, Germany},
Editor = {Bottoni, P. and Rosson, M. B.},
Publisher = {IEEE Computer Society},
Abstract = {Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis for simulation with the purpose to validate the model with respect to its requirements. Graph transformation systems have shown to be suitable for the definition of various kinds of visual modeling languages. They define a model�s operational semantics as the set of all transformations of a model which are specified by graph transformation rules. For automatic simulation, rules have to be structured to control their application order. During simulation, the state changes after each rule application should be visualized in the concrete syntax of the modeling language. In this paper, we propose a generic approach to specify simulation environments based on a model�s concrete syntax definition and suitable rule structuring techniques. We implement our approach using TIGER, a tool for defining visual languages based on graph transformation, and generate the specified simulation environment as plug-in for ECLIPSE. We demonstrate our approach by a case study for automatic simulation of Rubik�s Clock, a mechanical twosided puzzle of clocks controlled by rotating wheels.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/BEEH08.pdf},
Keywords = {graph transformation, visual editor, Eclipse, Rubik's Clock, simulation, visualization}
}
@inproceedings{BEEH09,
Title = {{Generation of Simulation Views for Domain Specific Modeling Languages based on the Eclipse Modeling Framework}},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Booktitle = {Automated Software Engineering (ASE'09)},
Pages = {625 -- 629},
Year = {2009},
Location = {Auckland, New Zealand, Nov. 16-20, 2009},
Editor = {Taentzer, G. and Heimdahl, M.},
Publisher = {IEEE Press},
Organization = {IEEE},
Abstract = {The generation of tools for domain specific modeling languages (DSMLs) is a key issue in model-driven development. Various tools already support the generation of domain-specific visual editors from models, but tool generation for visual behavior modeling languages is not yet supported in a satisfactory way. In this paper we propose a generic approach to specify DSML environments visually by models and transformation rules based on the Eclipse Modeling Framework (EMF). Editing rules define the behavior of generated visual editors, whereas simulation rules describe a model's operational semantics. From a DSML definition (model and transformation rules), an Eclipse plug-in is generated, implementing a visual DSML environment including an editor and (possibly multiple) simulators for different simulation views on the model. We present the basic components of Tiger2, our EMF-based generation environment, and demonstrate the environment generation process for a small DSML modeling the behavior of ants in an ant hill.}
}
@techreport{BEEH09b,
Title = {Generation of Simulation Views for Domain Specific Modeling Languages based on EMF: Long Version},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Year = {2009},
Number = {TR 2009-17},
Note = {\url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}},
Institution = {TU Berlin},
Abstract = {The generation of tools for domain specific modeling languages (DSMLs) is a key issue in model-driven development. Various tools already support the generation of domain-specific visual editors from models, but tool generation for visual behavior modeling languages is not yet supported in a satisfactory way. In this paper we propose a generic approach to specify DSML environments visually by models and transformation rules based on the Eclipse Modeling Framework (EMF). Editing rules define the behavior of generated visual editors, whereas simulation rules describe a model's operational semantics. From a DSML definition (model and transformation rules), an Eclipse plug-in is generated, implementing a visual DSML environment including an editor and (possibly multiple) simulators for different simulation views on the model. We present the basic components of Tiger2, our EMF-based generation environment, along the environment generation process for a small DSML modeling the behavior of ants in an ant hill.}
}
@inproceedings{BE09,
Title = {{Transforming BPMN to BPEL with EMF Tiger}},
Author = {Enrico Biermann and Claudia Ermel},
Booktitle = {Proc. Graph-based Tools (GraBaTs'09)},
Year = {2009},
Abstract = {This paper describes a model transformation from the Business Process Modeling Notation (BPMN) to the Business Process Execution Language for Web Services (BPEL4WS, or BPEL for short). We give the meta-models for both source and target language as EMF models and dene EMF model transformation rules using our recently developed tool EMF Tiger, an Eclipse plug-in supporting modeling and execution for EMF model transformations, based on structured data models and graph transformation concepts.},
Url = {http://is.tm.tue.nl/staff/pvgorp/events/grabats2009/submissions/}
}
@inproceedings{BEHM07,
Title = {{A Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework}},
Author = {Biermann, Enrico and Ermel, Claudia and Hermann, Frank and Modica, Tony},
Booktitle = {Proc. 14th Workshop on Algorithms and Tools for Petri Nets (AWPN'07)},
Year = {2007},
Address = {Universit\"at Koblenz-Landau, Germany},
Month = {October},
Editor = {Juhas, G. and Desel, J.},
Publisher = {GI Special Interest Group on Petri Nets and Related System Models},
Abstract = {The main idea behind Reconfigurable Object Nets (RONs) is the integration of transition firing and rule-based net structure transformation of place/transition nets during system simulation. RONs are high-level nets with two types of tokens: object nets (place/transition nets) and net transformation rules (a dedicated type of graph transformation rules). Firing of high-level transitions may involve firing of object net transitions, transporting object net tokens through the high-level net, and applying net transformation rules to object nets. Net transformations include net modifications such as merging or splitting of object nets, and net refinement. This approach increases the expressiveness of Petri nets and is especially suited to model mobile distributed processes. The paper presents a visual editor for RONs which has been developed in a student project at TU Berlin in summer 2007. The visual editor itself has been realized as a plug-in for ECLIPSE using the ECLIPSE Modeling Framework (EMF) and Graphical Editor Framework (GEF) plug-ins.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/BEHM07.pdf},
Keywords = {Petri nets, net transformation, graph transformation, visual editor, reconfigurable object net, Eclipse, GEF}
}
@inproceedings{BEJ10,
Title = {Modeling the "{Ecore to GenModel}" Transformation with {EMF Henshin}},
Author = {Biermann, E. and Ermel, C. and Jurack, S.},
Booktitle = {Proc. Transformation Tool Contest 2010 (TTC'10)},
Year = {2010},
Note = {\url{http://planet-research20.org/ttc2010/index.php?option=com_content&view=article&id=110&Itemid=152}},
Url = {http://planet-research20.org/ttc2010/index.php?option=com_content&view=article&id=110&Itemid=152#EcoreToGenModel}
}
@article{BEL+10,
Title = {Introduction to {AGG} and {EMF Tiger} by Modeling a Conference Scheduling System},
Author = {Biermann, E. and Ermel, C. and Lambers, L. and Prange, U. and Taentzer, G.},
Pages = {245--261},
Year = {2010},
Issn = {1433-2779 (Print) 1433-2787 (Online)},
Doi = {10.1007/s10009-010-0154-x},
Journal = {Int. Journal on Software Tools for Technology Transfer},
Volume = {12},
Number = {3-4},
Month = {Juli},
Publisher = {Springer},
Abstract = {In this paper we focus on the \emph{Conference Scheduling System}, a case study at the Tool Contest of Graph-Based Tools (GraBaTs) 2008. We took part in the contest with our graph transformation tool \textsc{AGG} and the \textsc{Eclipse}-based EMF model transformation tool \textsc{EMF Tiger}. We present the features of both tools and evaluate their abilities to model the conference scheduling system and to deal with additional contest assignments like model instance generation, property verification and interoperability.}
}
@article{BEMS08,
Title = {{Implementing Petri Net Transformations using Graph Transformation Tools}},
Author = {Biermann, E. and Ermel, C. and Modica, T. and Sylopp, P.},
Booktitle = {Proc. Third International Workshop on Petri Nets and Graph Transformations},
Year = {2008},
Isbn = {ISSN 1863-2122},
Location = {Leicester, UK},
Journal = {ECEASST},
Volume = {14},
Editor = {Baldan, P. and K\"onig, B.},
Abstract = {Petri net transformations have been defined formally in the abstract framework of adhesive HLR categories, which allows rule-based rewriting of graphlike structures, similar to graph transformation. In this paper we discuss differences between Petri net rewriting and graph rewriting which makes it necessary to add checks and conditions when implementing Petri net transformations using an existing graph transformation tool like AGG. The extensions concern the preservation of Petri net transition firing behavior and the mapping of markings. As a running example, we present the RON environment, a visual editor, simulator and net transformation tool for reconfigurable Petri nets which has been developed as a plug-in for ECLIPSE based on the graph transformation engine AGG.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/23},
Keywords = {Petri net transformation, graph transformation, graph transformation tool, AGG}
}
@article{BESW10,
Title = {Visual Modeling of Controlled {EMF} Model Transformation using {Henshin}},
Author = {Biermann, E. and Ermel, C. and Schmidt, J. and Warning, A.},
Booktitle = {Proc. 4th Intern. Workshop on Graph-Based Tools (GraBaTs'10)},
Pages = {1--14},
Year = {2010},
Isbn = {ISSN 1863-2122},
Journal = {ECEASST},
Volume = {32},
Abstract = {The tool HENSHIN is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the recent extensions of HENSHIN by control structures for controlled rule applications. The control structures comprise well-known imperative structures like sequences and conditions on rule applications. Moreover, application conditions for individual rules may now be arbitrarily nested and combined by logical connectors. We present the extension of the visual EMF model transformation environment Henshin to edit and perform controlled EMF model transformations along an example modeling a reactive Web service-based application (personal mobility manager).},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/43}
}
@inproceedings{BET08,
Title = {Precise Semantics of {EMF} Model Transformations by Graph Transformation},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Booktitle = {Proc. ACM/IEEE 11th International Conference on Model Driven Engineering Languages and Systems (MoDELS'08)},
Pages = {53--67},
Year = {2008},
Isbn = {978-3540878742},
Location = {Toulouse, France},
Volume = {5301},
Editor = {Czarnecki, K.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations wrt. functional behavior and correctness, a formal foundation is needed. In this paper, we define EMF model transformations as a special kind of typed graph transformations using node type inheritance. Containment constraints of EMF model transformations are translated to a special kind of EMF model transformation rules such that their application leads to consistent transformation results only. Thus, we identify a kind of EMF model transformations which behave like algebraic graph transformations. As a consequence, the rich theory of algebraic graph transformation can be applied to these EMF model transformations to show functional behavior and correctness. We illustrate our approach by selected refactorings of simplified statechart models.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/BET08.pdf},
Keywords = {EMF, model transformation, Eclipse, graph transformation, precise semantics}
}
@article{BET10,
Title = {Lifting Parallel Graph Transformation Concepts to Model Transformation based on the {E}clipse Modeling Framework},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Booktitle = {Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday},
Pages = {1--20},
Year = {2010},
Isbn = {ISSN 1863-2122},
Journal = {ECEASST},
Volume = {26},
Editor = {Frank Drewes and Annegret Habel and Berthold Hoffmann and Detlef Plump},
Abstract = {Model transformation is one of the key concepts in modeldriven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on dierent transformation aspects. This paper proposes parallel graph transformation introduced by Ehrig and Kreowski to be a suitable framework for modeling EMF model transformations with multiobject structures. Multi-object structures at transformation rule level provide a flexible way to describe the transformation of structures with a variable number of recurring structures, dependent on concrete model instances. Parallel graph transformation means massively parallelizing the application of model transformation rules synchronized at a kernel rule. We apply our extended EMF model transformation technique to model the simulation of statecharts with AND-states.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/36}
}
@article{BET11,
Title = {Formal Foundation of Consistent EMF Model Transformations by Algebraic Graph Transformation},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Pages = {227-250},
Year = {2012},
Issn = {1619-1366},
Journal = {Software and Systems Modeling (SoSyM)},
Volume = {11},
Number = {2},
Publisher = {Springer},
Abstract = {Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations with respect to functional behavior and correctness, a formal foundation is needed. In this paper, we define consistent EMF model transformations as a restricted class of typed graph transformations using node type inheritance. Containment constraints of EMF model transformations are translated to a special kind of graph transformation rules such that their application leads to consistent transformation results only. Thus, consistent EMF model transformations behave like algebraic graph transformations and the rich theory of algebraic graph transformation can be applied to these EMF model transformations to show functional behavior and correctness. Furthermore, we propose parallel graph transformation as a suitable framework for modeling EMF model transformations with multi-object structures. Rules extended by multi-object structures can specify a flexible number of recurring structures. The actual number of recurring structures is dependent on the application context of such a rule. We illustrate our approach by selected refactorings of simplified statechart models. Finally, we discuss the implementation of our concepts in a tool environment for EMF model transformations.},
Url = {http://dx.doi.org/10.1007/s10270-011-0199-7}
}
@incollection{BEEP14,
Title = {Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation},
Author = {Bucchiarone, Antonio and Ehrig, Hartmut and Ermel, Claudia and Pelliccione, Patrizio and Runge, Olga},
Booktitle = {Software, Services, and Systems},
Pages = {582-601},
Year = {2015},
Isbn = {978-3-319-15544-9},
Doi = {10.1007/978-3-319-15545-6_33},
Volume = {8950},
Editor = {De Nicola, Rocco and Hennicker, Rolf},
Publisher = {Springer International Publishing},
Series = {Lecture Notes in Computer Science},
Abstract = {Software systems nowadays require continuous operation despite changes both in user needs and in their operational environments. Self-adaptive systems are typically instrumented with tools to autonomously perform adaptation to these changes while maintaining some desired properties. In this paper we model and analyze self-adaptive systems by means of typed, attributed graph grammars. The interplay of different grammars representing the application and the adaptation logic is realized by an adaption manager. Within this formal framework we define consistency and operational properties that are maintained despite adaptations and we give static conditions for their verification. The overall approach is supported by the AGG tool for modeling, simulating, and analyzing graph transformation systems. A case study modeling a business process that adapts to changing environment conditions is used to demonstrate and validate the formal framework.},
Url = {http://dx.doi.org/10.1007/978-3-319-15545-6_33},
Language = {English}
}
@techreport{BEE+13a,
Title = {Modeling and Analysis of Self-Adaptive Systems Based on Graph Transformation},
Author = {Antonio Bucchiarone and Hartmut Ehrig and Claudia Ermel and Patrizio Pelliccione and Olga Runge},
Year = {2013},
Number = {2013/03},
Institution = {TU Berlin},
Abstract = {Software systems nowadays require continuous operation despite changes both in user needs and in their operational environments. Self-adaptive systems are typically instrumented with tools to autonomously perform adaptation to these changes while maintaining some desired properties. In this paper we model and analyze self-adaptive systems by means of typed, attributed graph grammars. The interplay of different grammars representing the application and the adaptation logic is realized by an adaption manager. Within this formal framework we define consistency and operational properties that are maintained despite adaptations and we give static conditions for their verification. The overall approach is supported by the AGG tool that offers the features for modeling, simulating, and analyzing graph transformation systems. A case study modeling a business process that adapts to changing environment conditions is used to demonstrate and validate the formal framework.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@inproceedings{EEE+07,
Title = {Information Preserving Bidirectional Model Transformations},
Author = {Hartmut Ehrig and Karsten Ehrig and Claudia Ermel and Frank Hermann and Gabriele Taentzer},
Booktitle = {Fundamental Approaches to Software Engineering},
Pages = {72--86},
Year = {2007},
Isbn = {978-3-540-71288-6},
Volume = {4422},
Editor = {Matthew B. Dwyer and Ant\´onia Lopes},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such as analysis, optimization, and code generation. Most of these transformations need to be bidirectional to e.g. report analysis results, or keep coherence between models. In several application-oriented papers it has been shown that triple graph grammars are a promising approach to bidirectional model transformations. But up to now, there is no formal result showing under which condition corresponding forward and backward transformations are inverse to each other in the sense of information preservation. This problem is solved in this paper based on general results for the theory of algebraic graph transformations. The results are illustrated by a transformation of class models to relational data base models which has become a quasistandard example for model transformation.},
Url = {http://www.springerlink.com/content/d3298714g2112360/},
Keywords = {bidirectional model transformation, graph transformation, triple graph grammar, information-preserving}
}
@inproceedings{EEEP06,
Title = {{Construction and Correctness Analysis of a Model Transformation from Activity Diagrams to Petri Nets}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. Intern. IMCAS Symposium on Mathematical Modelling (MathMod)},
Year = {2006},
Isbn = {ISBN 3-901608-25-7},
Editor = {Troch, I. and Breitenecker, F.},
Publisher = {ARGESIM-Reports},
Abstract = {With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated analysis and verification in the software development process. In this paper we use the concept of typed attributed graph transformation to construct a model transformation from a simple version of activity diagrams to Petri nets. Moreover our approach allows a correctness analysis which shows that this model transformation has functional behavior and is syntactically correct. This is the basis to use well-known analysis and verification techniques of Petri nets also for activity diagrams. The model transformation has been implemented in the Tiger environment developed at TU Berlin.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EEP06.pdf},
Keywords = {graph transformation, model transformation, activity diagrams, Petri nets}
}
@inproceedings{EEEP08,
Title = {{Consistent Integration of Models Based on Views of Visual Languages}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'08)},
Pages = {62--76},
Year = {2008},
Isbn = {978-3-540-78742-6},
Doi = {10.1007/978-3-540-78743-3},
Location = {Budapest, Hungary},
Volume = {4961},
Editor = {J.L.\ Fiadeiro and P. Inverardi},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modeling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete type graph and signature are known and necessary when modeling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to generalized typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeler to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result we present suitable conditions for the integration and decomposition of consistent view models. As a running example we use a visual domain-specific modeling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures.},
Url = {http://www.springerlink.com/content/rp75m54262n771x1},
Keywords = {graph transformation, visual languages, views, view integration}
}
@article{EEEP10,
Title = {{Consistent Integration of Models based on Views of Meta Models}},
Author = {Hartmut Ehrig and Karsten Ehrig and Claudia Ermel and Ulrike Prange},
Pages = {327-345},
Year = {2010},
Isbn = {ISSN 0934-5043},
Doi = {10.1007/s00165-009-0127-6},
Journal = {Formal Aspects of Computing},
Volume = {22 (3)},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to \emph{generalized} typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models and extend these conditions to view models defined over meta models with constraints. As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.}
}
@techreport{EEEP09a,
Title = {{Generalized Typed Attributed Graph Transformation Systems based on Morphisms Changing Type Graphs and Data Signatures}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Year = {2009},
Number = {2009-08},
Institution = {TU Berlin},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to \emph{generalized} typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models and extend these conditions to view models defined over meta models with constraints. As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}
}
@article{EEEP07,
Title = {{M}odel {T}ransformations by {G}raph {T}ransformation are {F}unctors},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Pages = {134--142},
Year = {2007},
Isbn = {ISSN 0252-9742},
Journal = {BEATCS},
Volume = {93},
Abstract = {In this paper, we extend our ideas on model transformations as functors discussed in the previous issue and embed this concept into the framework of graph transformation systems. We show that under certain restrictions of the rules model transformations by graph transformation are functors.},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin},
Keywords = {model transformation, graph transformation}
}
@inproceedings{EE08a,
Title = {{Semantical Correctness and Completeness of Model Transformations using Graph and Rule Transformation}},
Author = {Ehrig, H. and Ermel, C.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Pages = {194--210},
Year = {2008},
Location = {Leicester, UK},
Address = {Heidelberg},
Volume = {5214},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is \emph{semantically correct} if for each simulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have \emph{semantical completeness}, if for each simulation run of the target system we find a corresponding simulation run in the source system. In our framework of graph transformation, models are given by graphs, and graph transformation rules are used to define the operational behavior of visual models (called simulation rules). In order to compare the semantics of source and target models, we assume that in both cases operational behavior can be defined by simulation rules. The model transformation from source to target models is given by another set of graph transformation rules. These rules are also applied to the simulation rules of the source model. %The result of this rule transformation is compared with the given simulation rules of the target language.% w.r.t. the generated graph languages. The main result in this paper states the conditions for model and rule transformations to be semantically correct and complete. The result is applied to analyze the behavior of a model transformation from a domain-specific visual language for production systems to Petri nets.},
Url = {http://www.springerlink.com/index/45244x0306756185.pdf},
Keywords = {graph transformation, model and rule transformation, visual languages, semantical correctness, semantical completeness}
}
@techreport{EE08b,
Title = {{Semantical Correctness and Completeness of Model Transformations using Graph and Rule Transformation: Long Version}},
Author = {Ehrig, H. and Ermel, C.},
Year = {2008},
Number = {2008-13},
Institution = {Technische Universit\"at Berlin,Fakult\"at IV},
Abstract = {An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is \emph{semantically correct} if for each simulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have \emph{semantical completeness}, if for each simulation run of the target system we find a corresponding simulation run in the source system. In our framework of graph transformation, models are given by graphs, and graph transformation rules are used to define the operational behavior of visual models (called simulation rules). In order to compare the semantics of source and target models, we assume that in both cases operational behavior can be defined by simulation rules. The model transformation from source to target models is given by another set of graph transformation rules. These rules are also applied to the simulation rules of the source model. %The result of this rule transformation is compared with the given simulation rules of the target language.% w.r.t. the generated graph languages. The main result in this paper states the conditions for model and rule transformations to be semantically correct and complete. The result is applied to analyze the behavior of a model transformation from a domain-specific visual language for production systems to Petri nets.},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-13.pdf},
Keywords = {graph transformation, model and rule transformation, visual languages, semantical correctness, semantical completeness}
}
@article{EEE09,
Title = {{Refactoring of Model Transformations}},
Author = {Hartmut Ehrig and Claudia Ermel and Karsten Ehrig},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'09)},
Year = {2009},
Isbn = {{ISSN 1863-2122}},
Location = {York, UK},
Journal = {ECEASST},
Volume = {18},
Editor = {Heckel, Reiko and Boronat, Artur},
Publisher = {European Association of Software Science and Technology},
Abstract = {Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models), and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations which adapts the model transformation rules to the refactored models. In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known model transformation from statecharts to Petri nets.},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/27},
Keywords = {model transformation, graph transformation, model refactoring}
}
@techreport{EEE09a,
Title = {{Evolution of Model Transformations by Model Refactoring: Long Version }},
Author = {Hartmut Ehrig and Claudia Ermel and Karsten Ehrig},
Year = {2009},
Isbn = {{ISSN 1436-9915 }},
Number = {TR 2009-4},
Institution = {TU Berlin},
Abstract = {Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models), and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations which adapts the model transformation rules to the refactored models. In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known model transformation from statecharts to Petri nets.},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2009/tr-2009-04.pdf},
Keywords = {model transformation, graph transformation, model refactoring}
}
@book{EEGH15,
Title = {{Graph and Model Transformation: General Framework and Applications}},
Author = {Hartmut Ehrig and Claudia Ermel and Ulrike Golas and Frank Hermann},
Year = {2015},
Isbn = {ISBN = 978-3-662-47979-7},
Doi = {DOI = 10.1007/978-3-662-47980-3},
Publisher = {Springer Berlin Heidelberg},
Series = {Monographs in Theoretical Computer Science. An EATCS Series}
}
@inproceedings{EEH+12,
Title = {Confluence in Data Reduction: Bridging Graph Transformation and Kernelization},
Author = {Hartmut Ehrig and Claudia Ermel and Falk H\"uffner and Rolf Niedermeier and Olga Runge},
Booktitle = {Proc. of Int. Conf. on Computability in Europe (CiE'12)},
Pages = {193-202},
Year = {2012},
Volume = {7318},
Editor = {S. Barry Cooper and Anuj Dawar},
Publisher = {Springer},
Series = {LNCS},
Abstract = {Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A \emph{kernelization} reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter~$k$; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems \textsc{(Edge) Clique Cover} and \textsc{Partial Clique Cover} as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.}
}
@article{EEH+13,
Title = {Confluence in Data Reduction: Bridging Graph Transformation and Kernelization},
Author = {Hartmut Ehrig and Claudia Ermel and Falk H\"uffner and Rolf Niedermeier and Olga Runge},
Pages = {31-49},
Year = {2013},
Issn = {2211-3568},
Journal = {Computability},
Volume = {2},
Number = {1},
Publisher = {IOS Press},
Abstract = {Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A \emph{kernelization} reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter~$k$; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems \textsc{(Edge) Clique Cover} and \textsc{Partial Clique Cover} as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.},
Keywords = {kernelisation, graph Transformation, confluence, critical pair}
}
@inproceedings{EEH08,
Title = {{On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Booktitle = {Proc. Third International Workshop on Graph and Model Transformation (GraMoT'08)},
Pages = {9--16},
Year = {2008},
Isbn = {978-1-60558-079-1},
Doi = {http://doi.acm.org/10.1145/1402947.1402950},
Location = {Leipzig, Germany},
Address = {New York, NY, USA},
Editor = {Karsai, G. and Taentzer, G.},
Publisher = {ACM},
Series = {GRaMoT '08},
Keywords = {graph transformation, model transformation, triple graph grammars}
}
@inproceedings{EEH09,
Title = {{Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Booktitle = {Proc. International Conference on Fundamental Aspects of Software Engineering (FASE'09)},
Pages = {325-339},
Year = {2009},
Isbn = {978-3-642-00592-3},
Location = {York, UK},
Volume = {5503},
Editor = {Wirsing, M. and Chechik, M.},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Abstract = {E-government services usually process large amounts of confidential data, but simultaneously they shall provide simple and userfriendly graphical interfaces. Therefore, security requirements for the communication between components have to be adhered in a very strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and user-driven correction as well as possibilities for automatic analysis and verification of security requirements on the meta model level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy in order to enable the specification of relevant security requirements in this scenario. The extended theory is shown to fulfil the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable distributed critical pattern detection.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/EEH09.pdf},
Keywords = {model transformation, graph transformation, Security, E-Government, type graph with inheritance}
}
@techreport{EEH08c,
Title = {{On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars (Long Version)}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Year = {2008},
Number = {2008/05},
Institution = {Technische Universit\"at Berlin, Fakult\"at IV},
Abstract = {Triple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case. Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-05.pdf},
Keywords = {graph transformation, triple graphs, model transformation, plain graph grammar, flattening}
}
@article{EEHK09,
Title = {{Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation}},
Author = {Hartmut Ehrig and Claudia Ermel and Frank Hermann and Barbara K\"onig},
Pages = {117--125},
Year = {2009},
Journal = {BEATCS},
Volume = {97},
Abstract = {Our new project "Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation" funded by the German Research Council (DFG) has started in May 2008. In this contribution we present the main goals of the project and first results.},
Url = {http://www.eatcs.org/images/bulletin/beatcs97.pdf}
}
@inproceedings{EEHP09,
Title = {{On-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F. and Prange, U.},
Booktitle = {ACM/IEEE 12th Int. Conf. on Model Driven Engineering Languages and Systems (MODELS'09)},
Pages = {241--255},
Year = {2009},
Location = {Denver, Colorado, USA, Oct. 4-9, 2009},
Volume = {5795},
Editor = {Sch\"urr, A. and Selic, B.},
Publisher = {Springer},
Series = {LNCS},
Abstract = {Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rules for bidirectional model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we continue previous work on the formal definition of model transformations based on triple graph rules with negative application conditions (NACs). The new notion of partial source consistency enables us to construct consistent model transformations on-the-fly instead of analyzing consistency of completed model transformations. We show the crucial properties termination, correctness and completeness (including NAC-consistency) for the model transformations resulting from our construction. Moreover, we define parallel independence for model transformation steps which allows us to perform partial-order reduction in order to improve efficiency. The results are applicable to several relevant model transformations and in particular to our example transformation from class diagrams to database models.},
Url = {http://www.springerlink.com/index/j22k27g63p51v388.pdf}
}
@techreport{EEHP09b,
Title = {{On-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars: Long Version}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F. and Prange, U.},
Year = {2009},
Institution = {Technische Universit\"at Berlin},
Abstract = {Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rules for bidirectional model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we continue previous work on the formal definition of model transformations based on triple graph rules with negative application conditions (NACs). The new notion of partial source consistency enables us to construct consistent model transformations on-the-fly instead of analyzing consistency of completed model transformations. We show the crucial properties termination, correctness and completeness (including NAC-consistency) for the model transformations resulting from our construction. Moreover, we define parallel independence for model transformation steps which allows us to perform partial-order reduction in order to improve efficiency. The results are applicable to several relevant model transformations and in particular to our example transformation from class diagrams to database models.},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2009/tr-2009-11.pdf}
}
@techreport{EEH+07,
Title = {Concurrency in Reconfigurable Place/Transition Systems: Independence of Net Transformations as well as Net Transformations and Token Firing},
Author = {Ehrig, H. and Ermel, C. and Hoffmann, K. and Padberg, J. and Prange, U.},
Year = {2007},
Number = {2007-02},
Institution = {Technische Universit\"at Berlin,Fakult\"at IV},
Abstract = {Reconfigurable place/transition systems are Petri nets with initia lmarkings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements. For the transformation of Petri nets, adhesive high-level replacement systems have been recently introduced as a new categorical framework in the doublepushout approach. In this paper, we analyze concurrency in reconfigurable place/transition systems. We show that place/transition systems are a weak adhesive high-level replacement category, which allows us to apply the developed theory also to tranformations within reconfigurable place/transition systems. Furthermore, we analyze under which conditions net transformations and token firing can be executed in arbitrary order. As an illustrating example, reconfigurable place/transition systems are applied in a mobile network scenario.},
Url = {http://iv.tu-berlin.de/TechnBerichte/2007/2007-02.pdf},
Keywords = {reconfigurable Petri nets, concurrency, independence, firing behaviour}
}
@inproceedings{EER+10,
Title = {Formal Analysis and Verification of Self-Healing Systems},
Author = {Ehrig,H. and Ermel, C. and Runge, O. and Bucchiarone, A. and Pelliccione, P.},
Booktitle = {Proc. Intern. Conf. on Fundamental Aspects of Software Engineering (FASE'10)},
Pages = {139--153},
Year = {2010},
Isbn = {ISSN 0302-9743},
Volume = {6013},
Editor = {D. Rosenblum and G. Taentzer},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {Self-healing (SH) systems are characterized by an automatic discovery of system failures, and techniques how to recover from these situations. In this paper, we show how to model SH systems using algebraic graph transformation. These systems are modeled as typed graph grammars enriched with graph constraints. This allows not only for formal modelling of consistency and operational properties, but also for their formal analysis and verication using the tool AGG. As main results, we present sufficient static conditions for self-healing properties, deadlock-freeness and liveness of SH-systems. The overall approach is applied to a traffic light system case study, where the corresponding properties are verified.},
Url = {http://www.springerlink.com/content/hv51032524v38321/}
}
@techreport{EER+10b,
Title = {Formal Analysis and Verication of Self-Healing Systems: Long Version},
Author = {Ehrig, H. and Ermel, C. and Runge, O. and Bucchiarone, A. and Pelliccione, P.},
Year = {2010},
Isbn = {ISSN 1436-9915},
Number = {2010/04},
Note = {Available online at \url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}},
Institution = {Technische Universit\"at Berlin},
Abstract = {Self-healing (SH) systems are characterized by an automatic discovery of system failures, and techniques how to recover from these situations. In this paper, we show how to model SH systems using algebraic graph transformation. These systems are modeled as typed graph grammars enriched with graph constraints. This allows not only for formal modelling of consistency and operational properties, but also for their formal analysis and verication using the tool AGG. As main results, we present sufficient static conditions for self-healing properties, deadlock-freeness and liveness of SH-systems. The overall approach is applied to a traffic light system case study, where the corresponding properties are verified. This report is the long version (including proofs of technical theorems and the complete case study) of our paper at FASE 2010.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@inproceedings{EET11,
Title = {A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications},
Author = {Hartmut Ehrig and Claudia Ermel and Gabriele Taentzer},
Booktitle = {Int. Conf. on Fundamental Approaches to Software Engineering (FASE'11)},
Pages = {202-216},
Year = {2011},
Isbn = {978-3-642-19810-6},
Location = {Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbr\"ucken, Germany, March 26-April 3, 2011},
Volume = {6603},
Editor = {Dimitra Giannakopoulou and Fernando Orejas},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.},
Url = {http://www.springerlink.com/content/y722h2qp020l4217/}
}
@techreport{EET11a,
Title = {A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications},
Author = {Hartmut Ehrig and Claudia Ermel and Gabriele Taentzer},
Year = {2011},
Number = {2011/1},
Institution = {TU Berlin},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@incollection{EHP+08,
Title = {{Petri Net Transformations}},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J. and Ermel, C. and Prange, U. and Biermann, E. and Modica, T.},
Booktitle = {{Petri Net Theory and Applications}},
Pages = {1--16},
Year = {2008},
Isbn = {978-3-902613-12-7},
Publisher = {I-Tech Education and Publication},
Abstract = {Modelling the adaption of a system to a changing environment gets more and more important. Application areas cover e.g. computer supported cooperative work, multi agent systems, dynamic process mining or mobile networks. One approach to combine formal modelling of dynamic systems and controlled model adaption are Petri net transformations. The main idea behind net transformation is the stepwise development of place/transition nets by given rules. Think of these rules as replacement systems where the left-hand side is replaced by the right-hand side while preserving a context. This approach increases the expressiveness of Petri nets and allows in addition to the well known token game a formal description of structural changes.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EHP+08.pdf},
Keywords = {graph transformation, Petri net transformation, Petri net composition}
}
@inproceedings{EHP+07,
Title = {Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J. and Prange, U. and Ermel, C.},
Booktitle = {Proc. of 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency},
Pages = {104--123},
Year = {2007},
Volume = {4546},
Editor = {Jetty Kleijn and Alex Yakovlev},
Publisher = {Springer},
Series = {LNCS},
Abstract = {Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements of the environment. In this paper we use transformation rules for place/transition systems in the sense of the double pushout approach for graph transformation. The main problem in this context is to analyze under which conditions net transformations and token firing can be executed in arbitrary order. This problem is solved in the main theorems of this paper. Reconfigurable place/transition systems are applied in a mobile network scenario.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/EHP+07.pdf},
Keywords = {Petri net, transformation, independence, reconfigurable P/T nets}
}
@misc{EPEG99,
Title = {Petrinetze: {M}odellierung, {S}trukturierung und {K}ompositionalit\"at},
Author = {Ehrig, H. and Padberg, J. and Ermel, C. and Grigoriu, L.},
Year = {1999},
Howpublished = {Skript zur {L}ehrveranstaltung, SS99, Technische Universit\"at Berlin}
}
@techreport{EPT+09a,
Title = {{Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation: Long Version}},
Author = {H. Ehrig and U. Prange and G. Taentzer and C. Ermel and E. Biermann},
Year = {2009},
Note = {to appear},
Institution = {TU Berlin}
}
@inproceedings{EBT+08,
Title = {{The EMF Model Transformation Framework}},
Author = {Ehrig, K. and Biermann, E. and Taentzer, G. and Ermel, C. and K\"ohler, C.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Pages = {66--68},
Year = {2008},
Isbn = {ISBN-13: 978-3540890195},
Location = {Kassel, Germany},
Address = {Heidelberg},
Volume = {5088},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. The goal of the EMF Model Transformation framework (EMFTrans) is to support the modification of EMF models based on graphical EMF model transformation rules. EMFTrans currently consists of three components: a graphical editor for EMF model transformation rules, a compiler, generating Java code from these rules to be used in further projects, and an interpreter for the execution of the rules using AGG, a graph transformation tool environment.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EBT+08.pdf},
Keywords = {graph transformation, EMF, EMF transformation tool, EMFTrans, AGG}
}
@inproceedings{EEH05,
Title = {{Towards Model Transformation in Generated Eclipse Editor Plug-Ins}},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S.},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Address = {Tallinn, Estonia},
Volume = {152},
Month = {September},
Publisher = {Elsevier Science},
Abstract = {With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated code generation or verification in the software development process. In this paper, we describe a high-level concept for specifying model transformations by means of typed, attributed graph transformation at the level of formal visual language specifications for the source and the target language. At the implementation level, a graph-transformation based generator of visual editor Eclipse plug-ins from formal visual language specifications has been developed. On the basis of this generator we discuss concepts for an implementation of the presented model transformation concepts and for an integration with the generated Eclipse plug-ins. We explain the concepts for model transformation and their implementation along a concrete model transformation from activity diagrams to Petri nets.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EEH05.pdf},
Keywords = {model transformation, Eclipse, editor plug-in, code generation, graph transformation}
}
@inproceedings{EEHT04,
Title = {{Towards Graph Transformation based Generation of Visual Editors using Eclipse}},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S. and Taentzer, G.},
Booktitle = {Visual Languages and Formal Methods},
Pages = {127--143},
Year = {2004},
Volume = {127/4},
Editor = {Minas, M.},
Publisher = {Elsevier Science},
Series = {ENTCS},
Abstract = {This work discusses the state-of-the-art of visual editor generation based on graph transformation concepts on one hand, and using the Eclipse technology which includes the Graphical Editor Framework (GEF), on the other hand. Due to existing shortcomings in both approaches, we present a combined approach for a tool environment that allows to generate a GEF-based editor from a formal, graph-transformation based visual language specification.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EEHT04.pdf},
Keywords = {Graph Transformation, visual editor, Eclipse, editor generation}
}
@inproceedings{EEHT05,
Title = {Generation of Visual Editors as Eclipse Plug-Ins},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S. and Taentzer, G.},
Booktitle = {Proc. 20th IEEE/ACM International Conference on Automated Software Engineering},
Year = {2005},
Address = {IEEE Computer Society, Long Beach, California, USA},
Abstract = {Visual Languages (VLs) play an important role in software system development. Especially when looking at well-defined domains, a broad variety of domain specific visual languages are used for the development of new applications. These languages are typically developed specifically for a certain domain in a way that domain concepts occur as primitives in the language alphabet. Visual modeling environments are needed to support rapid development of domain-specific solutions. In this contribution we present a general approach for defining visual languages and for generating language-specific tool environments. The visual language definition is again given in a visual manner and precise enough to completely generate the visual environment. The underlying technology is Eclipse with its plug-in capabilities on the one hand, and formal graph transformation techniques on the other hand. More precisely, we present an Eclipse plug-in generating Java code for visual modeling plug-ins which can be directly executed in the Eclipse Runtime-Workbench.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EEHT05.pdf},
Keywords = {visual editor, Eclipse, editor generation, graph transformation}
}
@article{EET05,
Title = {{Erstellung eines grafischen Editor-Plug-Ins mit Eclipse EMF und GEF}},
Author = {Ehrig, K. and Ermel, C. and Taentzer, G.},
Pages = {31--34},
Year = {2005},
Journal = {OBJEKTspektrum},
Volume = {2},
Publisher = {Sigs-Datacom},
Abstract = {In dem Artikel wird die Generierung eines einfachen baumbasierten Eclipse Editor-Plug-Ins anhand eines Editors f\"ur Petrinetze mit dem Eclipse Modeling Framework (EMF) beschrieben. Aufbauend auf den generierten Modellcode wird die Implementierung eines zweiten komplexeren grafischen Editor-Plug-Ins mit dem Graphical Editor Framework (GEF) erl\"autert.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EET05.pdf},
Keywords = {Eclipse, EMF, GEF, Editor-Plug-In}
}
@article{Erm09,
Title = {Visual Modelling and Analysis of Model Transformations based on Graph Transformation},
Author = {Claudia Ermel},
Pages = {135 -- 152},
Year = {2009},
Journal = {Bulletin of the EATCS},
Volume = {99},
Abstract = {In the context of model-driven software development, the concepts of visual modelling and model transformation are of increasing importance. Although there is a wide range of tool support for designing and executing visual models and model transformations during system design, the analysis of model behaviour and of model transformation properties is not yet supported in a satisfactory way. In this article, we consider typed attributed graph transformation as formal framework for model transformations to deal with this problem. We give a conceptual overview on research activities and a survey of current research papers on the formalization of visual modelling and analysis of model transformations based on typed attributed graph transformation.},
Url = {http://www.eatcs.org/images/bulletin/beatcs99.pdf}
}
@phdthesis{Erm06,
Title = {{Simulation and Animation of Visual Languages based on Typed Algebraic Graph Transformation}},
Author = {Ermel, C.},
Year = {2006},
Isbn = {ISBN-10:3-8334-6321-X, ISBN-13:978-3-8334-6321-1},
Address = {Books on Demand, Norderstedt},
School = {Technische Universit\"at Berlin, Fak. IV},
Abstract = {In recent years, visual models represented by graphs have become very popular in systems development, as the wide-spread use of UML and Petri nets proves. While visual modeling techniques provide a precise way to model the structure and behavior of systems, visual models tend to be complex and are not always adequate for behavior validation. \\ The main objective of this doctoral thesis is to improve the validation process for visual behavioral models by providing a formal framework and tool support for simulation and animation based on typed algebraic graph transformation. To attain this goal, the thesis proposes to use \emph{animation views} for simulation instead of the notation of abstract modeling languages. Animation views allow to simulate model behavior in the layout of the application domain, at a freely chosen level of abstraction. Thus, they provide better insights of model behavior and lead to an earlier detection of inconsistencies and possible missing requirements in the model. A visual behavioral model is mapped to an animation view by so-called Simulation-to-Animation transformation (\emph{$\mathit{S2A}$ transformation}). Formal graph transformation properties allow to ensure semantical equivalence of a model and its animation view. The prototypical tool environment supports simulation, animation view definition, $\mathit{S2A}$ transformation and animation based on graph transformation. Animation scenarios can be visualized in animation views as smooth movements instead of discrete simulation steps.},
Url = {http://opus.kobv.de/tuberlin/volltexte/2006/1368/},
Keywords = {Simulation, Animation, Graph Transformation, Visualization}
}
@unpublished{Erm98a,
Title = {{Generierung eines graphischen Editors f\"ur Algebraische High-Level-Netze mit \textsc{GenGEd}}},
Author = {Ermel, C.},
Year = {1998},
Note = {Student's Project Status Report}
}
@techreport{Erm96,
Title = {{Anforderungsanalyse eines medizinischen Informationssystems mit Algebraischen High-Level-Netzen}},
Author = {Ermel, C.},
Year = {1996},
Number = {96-15},
Institution = {TU Berlin}
}
@unpublished{Erm94,
Title = {{K}ategorielle {D}arstellung von {S}tellen/{T}ransitions-{N}etzen},
Author = {Ermel, C.},
Year = {1994},
Note = {Studienarbeit, TU Berlin}
}
@inproceedings{BE03,
Title = {{Scenario Animation for Visual Behavior Models: A Generic Approach Applied to Petri Nets}},
Author = {Ermel, C. and Bardohl, R.},
Booktitle = {Proc. 10th Workshop on Algorithms and Tools for Petri Nets (AWPN'03)},
Year = {2003},
Address = {Kath. Universit\"at Eichst\"att-Ingolstadt, Germany},
Month = {September},
Editor = {Juhas, G. and Desel, J.},
Publisher = {GI Special Interest Group on Petri Nets and Related System Models},
Abstract = {The GenGED approach developed at the Technical University of Berlin allows the generic description of visual modeling languages based on formal graph transformation and graphical constraint solving techniques and tools. In this paper, the \GenGEd approach is reviewed and extended to allow the description of dynamic behavior and animation of systems. Visual simulation and animation rules are defined on top of the rules defining the corresponding visual modeling language (VL). Moreover, a domain-specific layout can be given for an animation view of the system under consideration. The visual language of Petri nets and a specific Petri net modeling a network protocol serve as running example, i.e., the system view is given by means of a Place/Transition nets. In the animation view, the network model shows directly the sending of messages between hosts in a network graph.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers03/EB03.pdf},
Keywords = {Petri Nets, Graph Transformation, Scenario, Animation}
}
@article{EB04,
Title = {{Scenario Animation for Visual Behavior Models: A Generic Approach}},
Author = {Ermel, C. and Bardohl, R.},
Pages = {164--177},
Year = {2004},
Journal = {Software and System Modeling: Special Section on Graph Transformations and Visual Modeling Techniques},
Volume = {3},
Number = {2},
Abstract = {Visualizing and simulating formal models in a flexible way becomes increasingly important for the design of complex systems. With GenGED, a tool is available which automatically generates a visual environment to process (create, edit, check, simulate) visual models over a specified visual language. Both the specification of the language and the model manipulation are based on graph grammars. In this paper, we present the means to transform visual models into application oriented views, called scenario views. We show how a model is consistently transferred to a scenario views and animated there. The extension of GenGED concerning scenario animation is discussed.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EB04.pdf},
Keywords = {Scenario animation, graph transformation, visual behavior model}
}
@inproceedings{EB02,
Title = {{Scenario Views for Visual Behavior Models in \textsc{GenGED}}},
Author = {Ermel, C. and Bardohl, R.},
Booktitle = {Proc. Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'02), Satellite Event of ICGT'02},
Pages = {71-83},
Year = {2002},
Address = {Barcelona, Spain},
Month = {October},
Abstract = {Visualizing and simulating the behavior of formal models in an adequate and flexible way becomes increasingly important in the design of complex systems. With GenGED, a tool is available which automatically generates a visual environment to process (create, edit, check, simulate) visual models in a specified formalism (a visual language). Both the specification of the formalism and the model manipulation are based on graph grammars. In this paper we present the means to transform a formal model into different application domain oriented views (scenario views). We show how the behavior of the model is transferred to the views and animated there (i.e. simulated in the layout of the application domain). Possible extensions towards animation modules (animated scenario views defined by \GenGED that are accessible from other tools) are discussed.},
Url = {http://www.cs.tu-berlin.de/%7Erosi/publications/EB02_gtVMT.ps.gz},
Keywords = {Graph Transformation, Scenarios, Visual Model, GenGED, Animation}
}
@inproceedings{EBE01,
Title = {{Specification and Implementation of Animation Views for Petri nets}},
Author = {Ermel, C. and Bardohl, R. and Ehrig, H.},
Booktitle = {Proc. of 2nd International Colloquium on Petri Net Technology for Comunication Based Systems},
Pages = {12},
Year = {2001},
Address = {Berlin, Germany},
Month = {September},
Editor = {DFG Research Group >>Petri Net Technology<<},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/PNT-Coll01.ps.gz},
Keywords = {Petri Nets, Animation, Graph Transformation}
}
@inproceedings{EBP01,
Title = {{Visual Design of Software Architecture and Evolution based on Graph Transformation}},
Author = {Ermel,C. and Bardohl,R. and Padberg,J.},
Booktitle = {Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA'01)},
Year = {2001},
Address = {Genova, Italy},
Volume = {44 (4)},
Month = {March 31st -- April 1st},
Editor = {Hartmut Ehrig, Claudia Ermel and Julia Padberg},
Publisher = {Elsevier Science Publishers},
Series = {ENTCS},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/UniGra01.ps.gz},
Keywords = {Software Architecture, Software Evolution, Graph Transformation, Visual Modeling, Components, Petri Nets}
}
@inproceedings{EBET08,
Title = {{Generating Eclipse Editor Plug-Ins using Tiger}},
Author = {Ermel, C. and Biermann, E. and Ehrig, K. and Taentzer, G.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Pages = {583--585},
Year = {2008},
Isbn = {ISBN-13: 978-3540890195},
Location = {Kassel, Germany},
Address = {Heidelberg},
Volume = {5088},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {We present Tiger, a visual environment to design visual language (VL) specifications based on meta models, graph grammars and layout definitions. A VL specification serves as basis to generate a visual editor for VL diagrams as Eclipse plug-in based on the Eclipse Graphical Editing Framework (GEF).},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EBET08.pdf},
Keywords = {graph transformation tool, Tiger, GEF, Eclipse, visual editor generation}
}
@inproceedings{EE07,
Title = {Behavior-Preserving Simulation-to-Animation Model and Rule Transformation},
Author = {Ermel, C. and Ehrig, H.},
Booktitle = {Proc. of Workshop on Graph Transformation for Verification and Concurrency (GT-VC'07)},
Pages = {55-74},
Year = {2008},
Volume = {213},
Editor = {K\"onig, B. and Heckel, R. and Rensink, A.},
Publisher = {Elsevier Science},
Series = {ENTCS},
Abstract = {In the framework of graph transformation, simulation rules define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules from simulation rules by so-called S2A-transformation. In contrast to simulation rules, animation rules use symbols representing entities from the application domain in a user-oriented visualization. Using animation views for model execution provides better insights of model behavior to users, leading to an earlier detection of model inconsistencies. Hence, an important requirement of the animation view construction is the preservation of the behavior of the original visual model. This means, we have to show on the one hand semantical correctness of the S2A-transformation, and, on the other hand, semantical correctness of a suitable backwards-transformation A2S. Semantical correctness of a model and rule transformation means that for each sequence of the source system we find a corresponding sequence in the target system. S2A-transformation has been considered in our contribution to GraMoT 2006. In this paper, we give a precise definition for animation-to-simulation (A2S) backward transformation, and show under which conditions semantical correctness of an A2S backward transformation can be obtained. The main result states the conditions for S2A-transformations to be behavior-preserving. The result is applied to analyze the behavior of a Radio Clock model�s S2A-transformation.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/EE07.pdf},
Keywords = {graph transformation, model and rule transformation, semantical correctness, simulation, animation, behavior-preserving transformation}
}
@inproceedings{EEE06a,
Title = {{Modeling Visual Languages based on Graph Transformation Concepts and Tools}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Booktitle = {Proc. Intern. IMCAS Symposium on Mathematical Modelling (MathMod)},
Year = {2006},
Isbn = {ISBN 3-901608-25-7},
Editor = {Troch, I. and Breitenecker, F.},
Publisher = {ARGESIM-Reports},
Abstract = {Visual languages and visual environments are increasingly important for software development. In this paper, we focus on the syntax definition of visual languages and visual models based on graph transformation. In analogy to textual language definition, graph grammars are used to define the structure of visual notations as well as their construction. Two tool environments are presented which have been developed at TU Berlin to support visual language modeling: The graph transformation engine AGG realizes attributed graph transformation at the abstract syntax level. The visual editor generator Tiger relies on AGG and on the graphical editor framework GEF of Eclipse, and generates a syntax-directed graphical editor from a visual language model given as a typed attributed graph transformation system.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EEE06a.pdf},
Keywords = {graph transformation, visual languages, visual language tools}
}
@article{EEE06,
Title = {{Semantical Correctness of Simulation-to-Animation Model and Rule Transformation}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Booktitle = {Proc. Int. Workshop on Graph and Model Transformation (GraMoT'06), Satellite Event of the IEEE Symposium on Visual Languages and Human-Centric Computing},
Year = {2006},
Issn = {ISSN 1863-2122},
Address = {Brighton, UK},
Journal = {ECEASST},
Volume = {4},
Abstract = {In the framework of graph transformation, simulation rules are well-known to define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules in a domain specific layout from simulation rules. An important requirement of this construction is the semantical correctness which has not yet been considered. In this paper we give a precise definition for simulation-to-animation (S2A) model and rule transformations. Our main results show under which conditions semantical correctness can be obtained. The results are applied to analyze the S2A transformation of a Radio Clock model.},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/5},
Keywords = {graph transformation, model and rule transformation, semantical correctness, simulation, animation}
}
@techreport{EEE06b,
Title = {{Semantical Correctness of Simulation-to-Animation Model and Rule Transformation: Long Version}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Year = {2006},
Isbn = {issn 1436-9915},
Number = {2006/10},
Institution = {TU Berlin, Fak. IV},
Url = {http://iv.tu-berlin.de/TechnBerichte/2006/2006-10.pdf}
}
@techreport{EEOT10,
Title = {Pre-Proceedings of the International Colloquium on Graph and Model Transformation � On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010)},
Author = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, T.},
Year = {2010},
Isbn = {ISSN 1436-9915},
Number = {2010/01},
Note = {Available online at \url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}},
Institution = {Technische Universit\"at Berlin},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@inproceedings{EET06,
Title = {{Simulation and Animation of Visual Models of Embedded Systems: A Graph-Transformation-Based Approach Applied to Petri Nets}},
Author = {Ermel, C. and Ehrig, H. and Taentzer, G.},
Booktitle = {Proc. 7th Workshop on Embedded Systems -- Modeling, Technology, and Applications, Technische Universit\"at Berlin},
Pages = {11--20},
Year = {2006},
Issn = {ISBN-10 1-4020-4932-3, ISBN-13 978-4020-4932-3},
Editor = {Hommel, G. and Sheng, H.},
Publisher = {SPRINGER},
Abstract = {Behavior specification techniques like Petri nets provide a visual description of software and embedded systems as basis for behavior validation by simulation. Graph transformation systems can be used as a unifying formal approach to define various visual behavior modeling languages including different kinds of Petri nets, activity diagrams, Statecharts etc., and to provide models with an operational semantics defining simulations of visual models based on graph transformation rules. Moreover, simulation of visual models can be extended by animation which allows to visualize the states of a model simulation run in a domain-specific layout which is closer to the problem domain than the layout of the abstract diagrammatic notation of the specification technique. This kind of model transformation is defined also within the framework of graph transformation, which allows to show interesting properties like semantical correctness of the animation with respect to simulation. In this paper we give an overview of simulation and animation of visual models based on graph transformation and discuss corresponding correctness issues.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EET06.pdf},
Keywords = {simulation, animation, graph transformation, Petri nets}
}
@article{EE10,
Title = {Graph Modelling and Transformation: Theory meets Practice},
Author = {Ermel, C. and Ehrig, K.},
Booktitle = {Proc. of Int. Colloquium on Graph and Model Transformation (GraMoT 2010)},
Pages = {1--22},
Year = {2010},
Isbn = {{ISSN 1863-2122}},
Journal = {ECEASST},
Volume = {30},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
Publisher = {European Association of Software Science and Technology},
Abstract = {In this paper, we focus on the role of graphs and graph transformation for four practical application areas from software system development. We present the typical problems in these areas and investigate how the respective systems are modelled by graphs and graph transformation. In particular, we are interested in the usefulness of theoretical graph transformation results and graph transformation tools in order to solve these problems. Finally, we characterize concepts and tool features which are still missing in practice to solve the presented and related problems even better.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {model transformation, graph transformation, model refactoring}
}
@inproceedings{EE04,
Title = {View Transformation in Visual Environments applied to {P}etri Nets},
Author = {Ermel, C. and Ehrig, K.},
Booktitle = {Proc. Workshop on Petri Nets and Graph Transformation (PNGT), Satellite Event of ICGT'04},
Pages = {61--86},
Year = {2005},
Volume = {127(2)},
Editor = {Rozenberg, G. and Ehrig, H. and Padberg, J.},
Publisher = {Elsevier Science},
Series = {ENTCS},
Abstract = {Visualizing and simulating the behavior of formal models in an adequate and flexible way becomes increasingly important for the design and validation of complex systems. Using graph transformation, the concrete and abstract syntax of various visual modelling languages can be described, and the semantics can be formalized. Moreover, graph transformation tools support visual model specification, simulation and analysis on the basis of the rich underlying theory. Despite these benefits, often the simulation of formal visual behavior models (e.g. Petri nets or statecharts) is not flexible enough and results in an ineffective validation process. In this paper we propose a formal, view-based approach to simulate and animate the behavior of visual models at different abstraction levels on the basis of typed, attributed graph transformation. We introduce so-called animation views, which allow to define scenario animations for a given behavior model in a systematic way. Based on the visual language definition for Algebraic High-Level Petri nets, the well-known specification of {\em The Dining Philosophers} serves as running example for the definition of an animation view and a scenario animation which directly visualizes the behavior of the dining philosophers sitting around a table. A prototypical implementation of the concepts for view definition, view transformation, simulation and scenario animation as new features of \GenGEDp, an environment for the definition of visual languages and the specification and simulation of visual behavior models, is presented.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EE04.pdf},
Keywords = {Graph Transformation, Petri Nets, Semantics}
}
@inproceedings{EE08,
Title = {{Visualization, Simulation and Analysis of Reconfigurable Systems}},
Author = {Ermel, C. and Ehrig, K.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE Symposium},
Pages = {265--281},
Year = {2008},
Isbn = {ISBN-13: 978-3540890195},
Location = {Kassel, Germany},
Address = {Heidelberg},
Volume = {5088},
Editor = {A. Sch\"urr and M. Nagl and A. Z\"undorf},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanced with information on concrete visualization of objects and relations, and the language syntax is defined by a graph grammar. Moreover, graph transformation can also formalize the semantic aspects of models, thus providing a basis for model validation by simulation. Apart from editing and simulating the behavior of a system, there may be necessary reconfiguration operations which change the underlying system structure at runtime. In this paper, we focus on the interrelation of simulation and reconfiguration operations using formal verification techniques based on graph transformation. Our approach is demonstrated by the definition of a domain-specific language for building, simulating and reconfiguring small railway systems, using the Tiger tool environment. For further verification, we define a model transformation from the railway domain to Petri nets.},
Url = {http://www.springerlink.com/index/e58250384p202404.pdf},
Keywords = {Petri nets, net transformation, graph transformation, visual editor, reconfigurable object net, Eclipse, GEF}
}
@inproceedings{EETW06,
Title = {{Object Oriented and Rule-based Design of Visual Languages using TIGER}},
Author = {Ermel, C. and Ehrig, K. and Taentzer, G. and Weiss, E.},
Booktitle = {Proc. Third International Workshop on Graph-Based Tools (GraBaTs'06)},
Year = {2006},
Issn = {ISSN 1863-2122},
Address = {Natal, Brazil},
Volume = {1},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Abstract = {In this paper we present the state-of-the-art of the TIGER environment for the generation of visual editor plug-ins in Eclipse, with the focus on its Designer component, a visual environment for object oriented and rule-based design of visual languages. Based on an alphabet for finite automata we show how a visual language can be designed by defining the abstract and concrete syntax of the visual language and syntax directed editing operations in the generated editor plug-in. For the graphical layout we use the Graphical Editing Framework (GEF) of ECLIPSE which offers an efficient and standardized way for graphical layouting.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EETW06.pdf},
Keywords = {graph transformation, visual language design, Tiger, editor generation, Eclipse}
}
@article{EFS11,
Title = {RONs Revisited: General Approach and Implementation of Reconfigurable Object Nets based on Algebraic High-Level Nets},
Author = {Claudia Ermel and Winzent Fischer and Sarkaft Shareef},
Booktitle = {Proc. Int. Workshop on Petri Nets and Graph Transformation Systems},
Year = {2011},
Journal = {ECEASST},
Volume = {40},
Editor = {Claudia Ermel and Kathrin Hoffmann},
Publisher = {ECEASST},
Abstract = {Reconfigurable Object Nets (RONs) have been implemented in our group to support the visual specification of controlled rule-based transformations of place/transition (P/T) nets. RONs are high-level nets (system nets) with two types of tokens: object nets (P/T nets) and net transformation rules. System net transitions can be of different types to fire object net transitions, move object nets through the system net, or to apply a net transformation rule to an object net. The disadvantage of the RON approach and tool is the limitation of object nets to P/T nets and the limitation of the underlying semantics of RONs due to the fixed types for system net transitions. Often, a more general approach is preferred where the type of object nets and the behavior of reconfigurations may be defined in a more flexible way. In this paper, we propose to use Algebraic High Level Nets with Individual Tokens (AHLI nets) as system nets. In this very general approach, tokens may have an arbitrary structure, depending on the corresponding algebraic signature and algebra. To support this general approach, a development environment for AHLI nets is currently implemented which allows the user to edit and simulate AHLI nets. The design of the tool enables language designers to define the visual appearance of different token structures in a flexible way. We present the formalization of RONs as special AHLI nets and describe the current state of the AHLI net tool environment.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {algebraic high-level net, visual editor, reconfigurable Petri net, graph transformation, tool environment, Eclipse plug-in, AGG, RON}
}
@inproceedings{EG97,
Title = {{Expanding the Use Of Structuring:Formal Justification for Working on Subnets}},
Author = {Ermel, C. and Gajewsky, M.},
Booktitle = {Workshop {P}etri {N}ets in {S}ystem {E}ngineering '97},
Pages = {44--54},
Year = {1997},
Address = {University Hamburg},
Month = {September},
Editor = {Farwer, B. and Moldt, D. and Stehr, M.-O.},
Publisher = {{FBI --HH--B--205/97}},
Url = {http://www.informatik.uni-hamburg.de/TGI/aktuelles/pnse97/papers.html}
}
@techreport{EGV+97,
Title = {Verifikation strukturierter {N}etze},
Author = {Ermel, C. and Gajewsky, M. and Vesper, T. and Weber, M.},
Year = {1997},
Number = {97--21},
Institution = {TU Berlin}
}
@inproceedings{EGLT11,
Title = {Modeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior},
Author = {Claudia Ermel and J\"urgen Gall and Leen Lambers and Gabriele Taentzer},
Booktitle = {Proc. Fundamental Aspects of Software Engineering (FASE'11)},
Pages = {156-170},
Year = {2011},
Volume = {6603},
Publisher = {Springer},
Series = {LNCS},
Abstract = {UML activity diagrams are a wide-spread modelling technique to capture behavioral aspects of system models. Usually, pre- and post-conditions of activities are described in natural language and are not formally integrated with the static domain model. Hence, early consistency validation of activity models is difficult due to their semi-formal nature. In this paper, we use integrated behavior models that integrate activity diagrams with object rules defining sets of actions in simple activities. We formalize integrated behavior models using typed, attributed graph transformation. It provides a basis for plausibility checking by static conflict and causality detection between specific object rules, taking into account their occurrence within the control flow. This analysis leads to favorable as well as critical signs for consistency of the integrated behavior model. Our approach is supported by \actigra, an \eclipse plug-in for editing, simulating and analyzing integrated behavior models. It visualizes favorable and critical signs for consistency in a convenient way and uses the well-known graph transformation tool \agg for rule application as well as static conflict and causality detection. We validate our approach modeling a conference scheduling system.},
Url = {http://www.springerlink.com/content/e0t437n346845055/}
}
@techreport{EGLT11a,
Title = {Modeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior},
Author = {Claudia Ermel and J�rgen Gall and Leen Lambers and Gabriele Taentzer},
Year = {2011},
Number = {2011/2},
Institution = {TU Berlin},
Abstract = {UML activity diagrams are a wide-spread modelling technique to capture behavioral aspects of system models. Usually, pre- and post-conditions of activities are described in natural language and are not formally integrated with the static domain model.Hence, early consistency validation of activity models is difficult due to their semi-formal nature. In this paper, we use integrated behavior models that integrate activity diagrams with object rules defining sets of actions in simple activities. We formalize integrated behavior models using typed, attributed graph transformation. It provides a basis for plausibility checking by static conflict and causality detection between specific object rules, taking into account their occurrence within the control flow.This analysis leads to favorable as well as critical signs for consistency of the integrated behavior model. Our approach is supported by ActiGra, an Eclipse plug-in for editing, simulating and analyzing integrated behavior models. It visualizes favorable and critical signs for consistency in a convenient way and uses the well-known graph transformation tool AGG for rule application as well as static conflict and causality detection.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@incollection{EG14,
Title = {Experiment Studentin: Ein schul\"ubergreifender Oberstufenkurs des Techno-Clubs an der Technischen Universit\"at Berlin und sein Informatik-Projekt},
Author = {Ermel, Claudia and Greusing, Inka},
Booktitle = {Informatikkultur neu denken - Konzepte f\"ur Studium und Lehre},
Pages = {57-70},
Year = {2014},
Isbn = {978-3-658-06021-3},
Doi = {10.1007/978-3-658-06022-0_4},
Editor = {Leicht-Scholten, Carmen and Schroeder, Ulrik},
Publisher = {Springer Fachmedien Wiesbaden},
Url = {http://dx.doi.org/10.1007/978-3-658-06022-0_4},
Language = {German}
}
@inproceedings{EHKZ05,
Title = {{Animated Simulation of Integrated UML Behavioral Models based on Graph Transformation}},
Author = {Ermel, C. and H\"olscher, K. and Kuske, S. and Ziemann, P.},
Booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)},
Year = {2005},
Address = {Dallas, Texas, USA},
Month = {September},
Editor = {Erwig, M. and Sch\"urr, A.},
Publisher = {IEEE Computer Society},
Abstract = {This paper shows how integrated UML models combining class, object, use-case, collaboration and state diagrams can be animated in a domain-specific layout. The presented approach is based on graph transformation, i.e.\ UML model diagrams are translated to a graph transformation system and the behavior of the integrated model is simulated by applications of graph transformation rules. For model validation, users may prefer to see the behavior of selected model aspects as scenarios presented in the layout of the application domain. We propose to integrate animation views with the model's graph transformation system. A prototypical validation system has been implemented recently supporting the automatic translation of a UML model into a graph transformation system, and the interactive execution and simulation of the model behavior. We sketch the tool interconnection to GenGED, a visual language environment which allows to enrich graph transformation systems for model simulation by features for animation.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EHKZ05.pdf},
Keywords = {simulation, animation, UML, graph transformation}
}
@article{EHGB12,
Title = {Visual Modeling and Analysis of EMF Model Transformations Based on Triple Graph Grammars},
Author = {Ermel, C. and Hermann, F. and Gall, J. and Binanzer, D.},
Booktitle = {Proc. 5th Intern. Workshop on Graph-Based Tools (GraBaTs'12)},
Pages = {1--14},
Year = {2012},
Isbn = {ISSN 1863-2122},
Journal = {ECEASST},
Volume = {54},
Abstract = {The tool Henshin is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the recent extensions of Henshin by a visual editor for triple graph grammars (TGGs). The visual editor (called HenshinTGG) supports a compact visualization of triple rules in an integrated editor panel. Internally, triple graph rules are represented as Henshin rules and can be simulated using the Henshin EMF model transformation engine. Our extension supports the automatic generation of forward translation rules for transforming source into target models. A converter from Henshin TGG rules to the graph transformation analysis tool AGG allows a systematic check for conflicts of forward translation rules in AGG based on critical pair analysis.},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/archive}
}
@techreport{EM96a,
Title = {{A} {T}aste of {C}ategorical {P}etri {N}ets},
Author = {Ermel, C. and Martini, A.},
Year = {1996},
Number = {96-9},
Month = {march},
Institution = {{TU Berlin}}
}
@techreport{EP97b,
Title = {Formalization of {V}ariables in {A}lgebraic {H}igh-{L}evel {N}ets},
Author = {Ermel, C. and Padberg, J.},
Year = {1997},
Number = {97-19},
Institution = {Technical {U}niversity Berlin}
}
@inproceedings{EPE96,
Title = {{Requirements Engineering of a Medical Information System Using Rule-Based Refinement of Petri Nets}},
Author = {Ermel, C. and Padberg, J. and Ehrig, H.},
Booktitle = {Proc. Integrated Design and Process Technology},
Pages = {186--193},
Year = {1996},
Note = {Vol.1},
Editor = {Cooke, D. and Kr\"amer, B.J. and Sheu, P. C-Y. and Tsai, J.P. and Mittermeir, R.},
Organization = {Society for Design and Process Science}
}
@book{ER20,
Title = {{Spa\ss mit Elektronik}},
Author = {Claudia Ermel and Ninett Rosenfeld},
Year = {2020},
Publisher = {Wiley},
Series = {{f\"ur Dummies Junior}},
Abstract = {Bastelst du gern? Und liebst du es, wenn es leuchtet, piept, blinkt und sich bewegt? In diesem Buch erfährst du Schritt für Schritt, wie du mit EEDs, Kondensatoren, Widerständen und anderen elektronischen Bauteilen nürtzliche und schöne Dinge wie Glückwunschkarten, Geschicklichkeitsspiele, Gespenster, Weihnachtsschmuck und Spielzeugautos basteln kannst. Du wirst von Anfang an auch löten! Nebenher lernst du, was Strom ist, warum man dafür Spannung braucht und wie alles fuktioniert. Leg einfach los!},
Url = {https://www.amazon.de/Spa%C3%9F-mit-Elektronik-Dummies-Junior/dp/3527717056/ref=sr_1_1?__mk_de_DE=%C3%85M%C3%85%C5%BD%C3%95%C3%91&dchild=1&keywords=ermel+spa%C3%9F+mit+elektronik&qid=1590166981&sr=8-1}
}
@book{ER17,
Title = {{Erste Schritte mit Python}},
Author = {Claudia Ermel and Olga Runge},
Year = {2017},
Publisher = {Wiley},
Series = {{f\"ur Dummies Junior}},
Abstract = {Bunte Spiralen, Sternenhimmel, blühende Bäume, Schneeflocken unterm Mikroskop? Mit diesem Buch lernst du, schöne Bilder am Computer zu zeichnen. Es fängt ganz leicht an: Zuerst lässt du die Schildkröte, die deinen Pinsel hält, nur über den Bildschirm laufen. Dann bringst du ihr bei, ein Dreieck zu zeichnen. Kombiniere Dreiecke zu Mosaiken und lasse Blumen und Bäume wachsen. Du hast ganz viele eigene Ideen für Bilder? Dieses Buch liefert dir die Python-Programmierbefehle dazu. Du lernst: •Wie du Python installierst •Wie du der zeichnenden Schildkröte Befehle gibst •Wie du dir mit Schleifen und Funktionen viel Arbeit sparst •Wie du Schachbretter, Bäume und Schneeflocken programmierst Claudia Ermel und Olga Runge sind Informatikerinnen. Ihre Begeisterung für das Fach geben sie im Schülerlabor dEIn-Labor an der Technischen Universität Berlin in Informatik-, Programmier- und Robotikkursen an Kinder und Jugendliche weiter.},
Url = {https://www.amazon.de/Erste-Schritte-Python-Dummies-Junior/dp/3527713522}
}
@techreport{ETB05a,
Title = {{Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation: Long Version}},
Author = {Ermel, C. and Taentzer, G. and Bardohl, R.},
Year = {2005},
Isbn = {1436-9915},
Number = {2004-21},
Institution = {Technische Universit\"at Berlin},
Abstract = {The ``classical'' approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic High-Level (AHL) nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach.},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/ETB05.pdf},
Keywords = {parallel graph transformation, algebraic high-level nets, Petri net semantics}
}
@incollection{EW01,
Title = {{Implementation of Parametrized Net Classes with the Petri Net Kernel of the Petri Net Baukasten}},
Author = {Ermel, C. and Weber, M.},
Booktitle = {Advances in Petri Nets: Unifying Petri Nets},
Year = {2001},
Volume = {2128},
Editor = {Ehrig, H. and Juh\´as, G. and Padberg, J. and Rozenberg, G.},
Publisher = {SPRINGER},
Series = {LNCS},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/UnifyingPN2001.ps.gz},
Keywords = {Petri Nets, Petri Net Kernel, Petri Net Baukasten}
}
@article{GLE12,
Title = {{Algebraic Approach to Timed Petri Nets}},
Author = {Gabriel, Karsten and Lingnau, Pascal and Ermel, Claudia},
Booktitle = {Proceedings of the 11th Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'12)},
Year = {2012},
Isbn = {{ISSN 1863-2122}},
Journal = {ECEASST},
Volume = {47},
Editor = {Andrew Fish and Leen Lambers},
Publisher = {European Association of Software Science and Technology},
Abstract = {One aspect often needed when modelling systems of any kind is time-based analysis, especially for real-time or in general time-critical systems. Algebraic place/transition (P/T) nets do not inherently provide a way to model the passing of time or to restrict the firing behaviour with regards to passing time.In this paper, we present an extension of algebraic P/T nets by adding time durations to transitions and timestamps to tokens. We define categories for different timed net classes and functorial relations between them.Our first result is the definition of morphisms preserving firing behaviour for all timed net classes. As second result, we define structuring techniques for timed P/T nets in a way that our category fulfills the properties of $\mathcal{M}$-adhesive systems, a general categorical framework for structuring and transforming high-level algebraic structures.We demonstrate our approach by applying it to model a real-time communication network.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {algebraic Petri nets, Petri nets with time, timed P/T nets, Petri net structuring technique, P/T net transformation}
}
@inproceedings{GE99,
Title = {{Transition Invariants in Algebraic High-Level Nets}},
Author = {Gajewsky, M. and Ermel, C.},
Booktitle = {4$^{th}$ World Conference on {I}ntegrated {D}esign and {P}rocess {T}echnology},
Year = {1999},
Note = {CD-ROM, 8 pages},
Editor = {A. Ertas}
}
@article{GBEE11,
Title = {{A Visual Interpreter Semantics for Statecharts Based on Amalgamated Graph Transformation}},
Author = {Golas, Ulrike and Biermann, Enrico and Ehrig, Hartmut and Ermel, Claudia},
Booktitle = {Selected Papers of Int. Workshop on Graph Computation Models (GCM'10)},
Year = {2011},
Isbn = {{ISSN 1863-2122}},
Journal = {ECEASST},
Volume = {39},
Editor = {Rachid Echahed, Annegret Habel, Mohamed Mosbah},
Publisher = {European Association of Software Science and Technology},
Abstract = {Several different approaches to define the formal operational semantics of statecharts have been proposed in the literature, including visual techniques based on graph transformation. These visual approaches either define a compiler semantics (translating a concrete statechart into a semantical domain) or they define an interpreter using complex control and helper structures. Based on the existing visual semantics definitions it is difficult to apply the classical theory of graph transformations to analyze behavioral statechart properties due to the complex control structures. In this paper, we define an interpreter semantics for statecharts based on amalgamated graph transformation where rule schemes are used to handle an arbitrary number of transitions in orthogonal states in parallel. We build on an extension of the existing theory of amalgamation from binary to multi-amalgamation including nested application conditions to control rule applications for automatic simulation. This is essential for the interpreter semantics of statecharts. The theory of amalgamation allows us to show termination of the interpreter semantics of well-behaved statecharts, and especially for our running example, a producer-consumer system.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {model transformation, triple graph grammar, application condition}
}
@inproceedings{GHE+13,
Title = {Towards Bidirectional Engineering of Satellite Control Procedures Using Triple Graph Grammars},
Author = {Susann Gottmann and Frank Hermann and Claudia Ermel and Thomas Engel and Gianluigi Morelli},
Booktitle = {Proceedings of the 7th Workshop on Multi-Paradigm Modeling (MPM 2013)},
Pages = {67-76},
Year = {2013},
Issn = {1613-0073},
Address = {Aachen},
Number = {1112},
Editor = {Christophe Jacquet and Daniel Balasubramanian and Edward Jones and Tam\´as M\´esz\´aros},
Series = {CEUR Workshop Proceedings},
Abstract = {The development and maintenance of satellite control software are very complex, mission-critical and cost-intensive tasks that require expertise from different domains. In order to adequately address these challenges, we propose to use visual views of the software to provide concise abstractions of the system from different perspectives. This paper introduces a visual language for process flow models of satellite control procedures that we developed in cooperation with the industrial partner SES for the satellite control language SPELL. Furthermore, we present a general and formal bidirectional engineering approach for automatically translating satellite control procedures into corresponding process flow visualisations. The bidirectional engineering framework is supported by a visual editor based on Eclipse GMF, the transformation tool HenshinTGG, and additional extensions to meet requirements set up by the specific application area of satellite control languages.},
Url = {http://ceur-ws.org/Vol-1112/}
}
@inproceedings{GHN+13,
Title = {Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars},
Author = {Gottmann, S. and Hermann, F. and Nachtigall, N. and Braatz, B. and Ermel, C. and Ehrig, H. and Engel, T.},
Booktitle = {Proc. Int. Workshop on Analysis of Model Transformations 2013 (AMT'13)},
Pages = {67-76},
Year = {2013},
Issn = {1613-0073},
Location = {Miami, USA, September 2013},
Address = {Aachen},
Number = {1112},
Editor = {Baudry, B. and Dingel, J. and Lucio, L. and Vangheluwe, H.},
Series = {CEUR Workshop Proceedings},
Abstract = {Triple graph grammars (TGGs) have been applied successfully for specifying and analysing bidirectional model transformations. Recently, a formal approach to concurrent model synchronisation has been presented, where source and target modifications are synchronised simultaneously. In addition to methods for update propagation, the approach includes a semi-automatic strategy for conflict resolution. Up to now, this approach has been limited to deterministic propagation operations. In this paper, we generalise the approach to arbitrary TGGs and consider non-deterministic operations which might yield dierent results and require back tracking. We show correctness and completeness of the extended approach and provide a technique for reducing and possibly eliminating backtracking to improve efficiency.},
Url = {http://ceur-ws.org/Vol-1077/},
Keywords = {concurrent model synchronisation, bidirectional model transformation, triple graph grammars}
}
@inproceedings{GNE+16,
Title = {Towards the Propagation of Model Updates along different Views in Multi-View Models},
Author = {Gottmann, S. and Nachtigall, N. and Ermel, C. and Hermann, F. and Engel, T.},
Booktitle = {5th International Workshop on Bidirectional Transformations},
Pages = {45-60},
Year = {2016},
Volume = {1571},
Publisher = {CEUR Workshop Proceedings},
Abstract = {Models are the keystones in model-driven systems development. They describe systems at different layers of abstraction and with a focus to different domains. For each domain, dedicated domain specific visual modelling languages are used for model definitions with the idea to separate concerns to different domain experts. This enables precise problem and requirement definitions and should decrease efforts in developing and validating systems. We focus on multi-view models that are in relationship with source models by triple graph grammars. A multi-view model provides different views of the source model at different layers of abstraction but within the same DSL which is typically different from the DSL of the source model. In practice, elements in different views may overlap. We present an informal methodology for consistently propagating updates from one view to the other views and also to the source domain. We motivate our approach by multi-view models in a hospital scenario.},
Url = {http://ceur-ws.org/Vol-1571/paper_7.pdf}
}
@techreport{HEE07a,
Title = {Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (Long Version)},
Author = {Hermann, F. and Ehrig, H. and Ermel, C.},
Year = {2008},
Isbn = {ISSN 1436-9915},
Number = {2008/07},
Institution = {Technische Universit\"at Berlin, Fak. IV},
Abstract = {E-government services usually process large amounts of condential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and user-driven correction as well as possibilities for automatic analysis and verification at meta-model level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy. We apply the framework to specify relevant security requirements. The extended theory is shown to full the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable parallel critical pattern detection and elimination.},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2008/2008-07.pdf}
}
@inproceedings{HEEO12,
Title = {Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars},
Author = {Frank Hermann and Hartmut Ehrig and Claudia Ermel and Fernando Orejas},
Booktitle = {Int. Conf. on Fundamental Approaches to Software Engineering (FASE'12)},
Pages = {178-193},
Year = {2012},
Location = {Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estland, March 23 - April 1, 2012},
Volume = {7212},
Editor = {Juan de Lara and Andrea Zisman},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.}
}
@techreport{HEEO11a,
Title = {Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars - Extended Version},
Author = {Frank Hermann and Hartmut Ehrig and Claudia Ermel and Fernando Orejas},
Year = {2011},
Number = {2011/14},
Institution = {TU Berlin},
Abstract = {Triple graph grammars (TGGs) have been used successfully to analyse correctness of bidirectional model transformations. Most recently, also a corresponding formal approach to model synchronization has been presented, where a forward propagation operation updates a source model modification from source to target, and symmetrically, a backward propagation operation takes care of updates from target to source models. However, a corresponding formal approach of concurrent model synchronization, where a source and a target modification have to be synchronized simultaneously, has not yet been presented and analysed. This paper closes this gap taking into account that the given and propagated source or target model modifications are in conflict with each other. Our conflict resolution strategy is semi-automatic, where a formal resolution strategy – known from previous work – can be combined with a user-specific strategy. As first main result, we show correctness of concurrent model synchronization with respect to the TGG. This means that each result of our nondeterministic concurrent update leads to a consistent correspondence between source and target models, where consistency is defined by the TGG. As second main result, we show compatibility of concurrent with basic model synchronization. In other words, concurrent model synchronization can be realized either to coincide with forward or with backward propagation. The main results are illustrated by a running example on updating organizational models.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@inproceedings{HGN+14,
Title = {Triple Graph Grammars in the Large for Translating Satellite Procedures},
Author = {Frank Hermann and Susann Gottmann and Nico Nachtigall and Hartmut Ehrig and Benjamin Braatz and Gianluigi Morelli and Alain Pierre and Thomas Engel and Claudia Ermel},
Booktitle = {Proc. Int. Conf. on Model Transformations (ICMT 2014)},
Pages = {122-137},
Year = {2014},
Address = {Switzerland},
Number = {8568},
Editor = {{Di Ruscio}, D. and Varro, D.},
Publisher = {Springer International Publishing},
Series = {Lecture Notes of Computer Science},
Abstract = {Software translation is a challenging task. Several requirements are important – including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability concerning the correctness of the translation. Triple graph grammars (TGGs) have shown to be an intuitive, welldefined technique for model translation. In this paper, we leverage TGGs for industry scale software translations. The approach is implemented using the Eclipse-based graph transformation tool Henshin and has been successfully applied in a large industrial project with the satellite operator SES on the translation of satellite control procedures. We evaluate the approach regarding requirements from the project and performance on a complete set of procedures of one satellite.},
Keywords = {model transformation, software translation, refactoring, triple graph grammars, Eclipse Modeling Framework (EMF)}
}
@inproceedings{HGN+13,
Title = {{Triple Graph Grammars in the Large for Translating Satellite Procedures}},
Author = {Hermann, Frank and Gottmann, Susann and Nachtigall,Nico and Ehrig, Hartmut and Braatz,Benjamin and Morelli,Gianluigi and Pierre, Alain and Engel,Thomas and Ermel,Claudia},
Booktitle = {Proc. Int. Conf. on Theory and Practice of Model Transformations (ICMT'13)},
Pages = {50-51},
Year = {2013},
Isbn = {978-3-642-38882-8},
Volume = {7909},
Editor = {Keith Duddy and Gerti Kappel},
Publisher = {Springer},
Series = {LNCS}
}
@techreport{HGN+14a,
Title = {Triple Graph Grammars in the Large for Translating Satellite Procedures: Extended Version},
Author = {Frank Hermann and Susann Gottmann and Nico Nachtigall and Hartmut Ehrig and Benjamin Braatz and Gianluigi Morelli and Alain Pierre and Thomas Engel and Claudia Ermel},
Pages = {1-22},
Year = {2014},
Isbn = {978-2-87971-128-7},
Address = {Luxemburg},
Number = {TR-SnT-2014-7},
Institution = {University of Luxemburg},
Abstract = {Software translation is a challenging task. Several requirements are important – including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability concerning the correctness of the translation. Triple graph grammars (TGGs) have shown to be an intuitive, welldefined technique for model translation. In this paper, we leverage TGGs for industry scale software translations. The approach is implemented using the Eclipse-based graph transformation tool Henshin and has been successfully applied in a large industrial project with the satellite operator SES on the translation of satellite control procedures. We evaluate the approach regarding requirements from the project and performance on a complete set of procedures of one satellite.},
Url = {http://hdl.handle.net/10993/16887},
Keywords = {model transformation, software translation, refactoring, triple graph grammars, Eclipse Modeling Framework (EMF)}
}
@article{LETE04,
Title = {Parallel Graph Transformation for Model Simulation applied to Timed Transition {P}etri Nets},
Author = {de Lara, J. and Ermel, C. and Taentzer, G. and Ehrig, K.},
Pages = {17-29},
Year = {2004},
Journal = {ENTCS},
Volume = {109},
Abstract = {This paper discusses the use of parallel graph transformation systems for (multi-formalism) modeling and simulation and their implementation in the meta-modeling tool AToM3. Parallel graph transformation is used to describe the application of rule schemes in an unknown context. This is important for obtaining general descriptions of the behavior of visual models like Petri nets. After reviewing the concepts of parallel graph transformation which is based on rule amalgamation according to certain rule interaction schemes, a simulator for Timed Transition Petri Nets is modeled using meta-modeling and parallel graph transformation. The extensions of AToM3 in order to support the definition and application of amalgamated rules are also discussed in the paper.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/LETE04.pdf},
Keywords = {model transformation, graph transformation, timed transition petri nets}
}
@article{MEE11,
Title = {Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Booktitle = {Proc. Int. Workshop on Petri Nets and Graph Transformation Systems},
Year = {2011},
Journal = {ECEASST},
Volume = {40},
Editor = {Claudia Ermel and Kathrin Hoffmann},
Publisher = {ECEASST},
Abstract = {Various kinds of graph transformations and Petri net transformation systems are examples of $\mathcal{M}$-adhesive transformation systems based on $\mathcal{M}$-adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net transformation systems, the RON-Environment, has recently been developed which implements and simulates Petri net transformations based on corresponding graph transformations using AGG. Up to now, the correspondence between Petri net and graph transformations is handled on an informal level. The purpose of this paper is to establish a formal relationship between the corresponding $\mathcal{M}$-adhesive transformation systems, which allow the translation of Petri net transformations into graph transformations with equivalent behavior, and, vice versa, the creation of Petri net transformations from graph transformations. Since this is supposed to work for different kinds of Petri nets, we propose to define suitable functors, called $\mathcal{M}$-functors, between different $\mathcal{M}$-adhesive categories and to investigate properties allowing us the translation and creation of transformations of the corresponding $\mathcal{M}$-adhesive transformation systems.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@article{MEE12,
Title = {Transfer of Local Confluence and Termination between {P}etri Net and Graph Transformation Systems Based on $\mathcal{M}$-Functors},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Booktitle = {Proc. of 5th Workshop on Petri Nets and Graph Transformation (PNGT)},
Pages = {1-12},
Year = {2012},
Isbn = {{ISSN 1863-2122}},
Journal = {ECEASST},
Volume = {51},
Editor = {Padberg, J. and Hoffmann, K.},
Publisher = {European Association of Software Science and Technology},
Abstract = {Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of \Madh-functors $\Fadh: (\cat{C_1}, \Madh_1) \fun (\cat{C_2}, \Madh_2)$ between \Madh-adhesive categories. This new approach allows to translate transformations in $(\cat{C_1}, \Madh_1)$ into corresponding transformations in $(\cat{C_2}, \Madh_2)$ and, vice versa, to create transformations in $(\cat{C_1}, \Madh_1)$ from those in $(\cat{C_2}, \Madh_2)$. This is helpful because our tool for reconfigurable Petri nets, the RON-tool, performs the analysis of Petri net transformations by analyzing corresponding graph transformations using the AGG-tool. Up to now, this correspondence has been implemented as a converter on an informal level. The formal correspondence results given by our framework make the RON-tool more reliable. In this paper we extend this framework to the transfer of local confluence, termination and functional behavior. In particular, we are able to create these properties for transformations in $(\cat{C_1}, \Madh_1)$ from corresponding properties of transformations in $(\cat{C_2}, \Madh_2)$, where $(\cat{C_1}, \Madh_1)$ are Petri nets with individual tokens and $(\cat{C_2}, \Madh_2)$ typed attributed graphs. This allows us to apply the well-known critical pair analysis for typed attributed graph transformations supported by the AGG-tool in order to analyze these properties for Petri net transformations.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {$\mathcal{M}$-adhesive transformation system, graph transformation, Petri net transformation, confluence, termination, functional behavior}
}
@article{MEE13,
Title = {{Analysis of Hypergraph Transformation Systems in AGG based on M-Functors}},
Author = {Maximova, M. and Ehrig, H. and Ermel, C.},
Booktitle = {Proceedings of the International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'13)},
Year = {2013},
Isbn = {{ISSN 1863-2122}},
Journal = {ECEASST},
Volume = {58},
Editor = {Tichy, M. and Ribeiro, L.},
Publisher = {European Association of Software Science and Technology},
Abstract = {Hypergraph transformation systems are examples of M-adhesive transformation systems based on M-adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simu- lation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding M-adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory of M-functors between different M-adhesive transformation systems. We construct a functor between the M-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M-functor with suitable properties. We then use existing results for M-functors to show that analysis results for hypergraph transformation systems can be obtained using AGG by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive},
Keywords = {hypergraph transformation systems, graph transformation, confluence analysis, AGG, M-functor}
}
@article{DBLP:journals/scp/MaximovaEE15,
Title = {Local confluence analysis of hypergraph transformation systems with application conditions based on M-functors and {AGG}},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Pages = {44--70},
Year = {2015},
Issn = {0167-6423},
Doi = {10.1016/j.scico.2014.10.002},
Journal = {Sci. Comput. Program.},
Volume = {104},
Abstract = {For typed attributed graph transformation systems, the tool environment Agg supports modelling, simulation and analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. In this paper we establish a formal relationship between the corresponding M -adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behaviour, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This relationship is based on the general theory of M -functors between different M -adhesive transformation systems which is extended in this paper to rules with application conditions. Our main result shows the creation of local confluence based on F -reachable critical pairs for rules with application conditions, where F is a suitable M -functor. We construct a functor between the M -adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M -functor with properties required by the general theory. Hence, analysis results for hypergraph transformation systems can be obtained using Agg for analysing the translated typed attributed graph transformation systems.},
Url = {http://dx.doi.org/10.1016/j.scico.2014.10.002},
Keywords = {M -adhesive transformation system}
}
@article{MEE14,
Title = {Local confluence analysis of hypergraph transformation systems with application conditions based on {M}-functors and {AGG}},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Pages = {-},
Year = {2014},
Issn = {0167-6423},
Doi = {http://dx.doi.org/10.1016/j.scico.2014.10.002},
Journal = {Science of Computer Programming},
Number = {0},
Abstract = {Abstract For typed attributed graph transformation systems, the tool environment Agg supports modelling, simulation and analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. In this paper we establish a formal relationship between the corresponding M -adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behaviour, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This relationship is based on the general theory of M -functors between different M -adhesive transformation systems which is extended in this paper to rules with application conditions. Our main result shows the creation of local confluence based on F -reachable critical pairs for rules with application conditions, where F is a suitable M -functor. We construct a functor between the M -adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M -functor with properties required by the general theory. Hence, analysis results for hypergraph transformation systems can be obtained using Agg for analysing the translated typed attributed graph transformation systems.},
Url = {http://www.sciencedirect.com/science/article/pii/S0167642314004432},
Keywords = {M -adhesive transformation system}
}
@techreport{MEE13a,
Title = {{Analysis of Hypergraph Transformation Systems in AGG based on $\mathcal{M}$-Functors}},
Author = {Maximova, Maria and Ehrig, Hartmut and Ermel, Claudia},
Year = {2013},
Issn = {1436-9915},
Number = {2013/02},
Institution = {Fakult\"at IV, Technische Universit\"at Berlin},
Abstract = {Hypergraph transformation systems are examples of \madh transformation systems based on $\mathcal{M}$-adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding \madh transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory of $\mathcal{M}$-functors between different $\mathcal{M}$-adhesive transformation systems. We construct a functor between the $\mathcal{M}$-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an $\mathcal{M}$-functor with suitable properties. We then use existing results for $\mathcal{M}$-functors to show that analysis results for hypergraph transformation systems can be obtained using AGG by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/},
Keywords = {graph transformation, critical pair analysis, hypergraph, M-Functor, confluence}
}
@techreport{MEE12a,
Title = {Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors -- Extended Version},
Author = {Maximova, M. and Ehrig, H. and Ermel, C.},
Year = {2012},
Number = {2012/08},
Institution = {Technische Universit\"at Berlin},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2012}
}
@techreport{MEE11a,
Title = {{Functors between M-adhesive Categories Applied to Petri Net and Graph Transformation Systems}},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Year = {2011},
Number = {2011/04},
Institution = {TU Berlin},
Abstract = {Various kinds of graph transformations and Petri net transformation systems are examples of $\mathcal{M}$-adhesive transformation systems based on $\mathcal{M}$-adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net transformation systems, the RON-Environment, has recently been developed which implements and simulates Petri net transformations based on corresponding graph transformations using AGG. Up to now, the correspondence between Petri net and graph transformations is handled on an informal level. The purpose of this paper is to establish a formal relationship between the corresponding $\mathcal{M}$-adhesive transformation systems, which allow the translation of Petri net transformations into graph transformations with equivalent behavior, and, vice versa, the creation of Petri net transformations from graph transformations. Since this is supposed to work for different kinds of Petri nets, we propose to define suitable functors, called $\mathcal{M}$-functors, between different $\mathcal{M}$-adhesive categories and to investigate properties allowing us the translation and creation of transformations of the corresponding $\mathcal{M}$-adhesive transformation systems.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@inproceedings{MBE09,
Title = {{An ECLIPSE Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models}},
Author = {Tony Modica and Enrico Biermann and Claudia Ermel},
Booktitle = {GI-Workshop on Methodological Development of Modelling Tools},
Year = {2009},
Abstract = {Model-based development has an increasing importance in modern softwareengineering and other domains. Visual models such as Petri nets andUMLdiagrams proved to be an adequate way to illustrate many structuraland behavioralsystem properties. However, while tooling for textual modeling is pretty mature now,visual tool builders are faced with a much higher complexity regarding the representation of model properties, and the interplay of the concrete syntax (theviews) withthe underlying abstract model representation, e.g. based on Java,XML or the EclipseModeling Framework (EMF). In order to ease the development of visual editors, the Graphical Editing Framework (GEF) offers layout and rendering possibilities, as wellas an architecture that allows to integrate models based on EMF, Javaor XMI withtheir visual views and editors. Unfortunately, the structure of GEF is quite complex touse if editors are not simply one-to-one representations of model elements, or if more than one view is needed at a time for more complex models. Based on several years of experience in teaching the development of GEF-based visual editors for complex visual models to students, we developed MUVITORKIT (Multi-View Editor Kit), a framework for rich-featured visual editors, which is presentedin this paper. MUVITORKIT is based on EMF and GEF, and supports nested models, models needing multiple graphical viewers, and animated simulation of model behavior. The architecture of MUVITORKIT is designed in a way that encapsulates the complex underlying mechanisms in GEF and simplifies the integration in the ECLIPSE workbench.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/MBE09a.pdf}
}
@misc{MBE09a,
Title = {An ECLIPSE Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models: Long Version},
Author = {Modica, T. and Biermann, E. and Ermel, C.},
Year = {2009},
Howpublished = {Internal Report},
Abstract = {Model-based development has an increasing importance in modern software engineering and other domains. Visual models such as Petri nets and UML diagrams proved to be an adequate way to illustrate many structural and behavioral system properties. However, while tooling for textual modeling is pretty mature now, visual tool builders are faced with a much higher complexity regarding the representation of model properties, and the interplay of the concrete syntax (the views) with the underlying abstract model representation, e.g. based on Java, XML or the Eclipse Modeling Framework (EMF). In order to ease the development of visual editors, the Graphical Editing Framework (GEF) offers layout and rendering possibilities, as well as an architecture that allows to integrate models based on EMF, Java or XMI with their visual views and editors. Unfortunately, the structure of GEF is quite complex to use if editors are not simply one-to-one representations of model elements, or if more than one view is needed at a time for more complex models. Based on several years of experience in teaching the development of GEF-based visual editors for complex visual models to students, we developed MUVITORKIT (Multi-View Editor Kit), a framework for rich-featured visual editors, which is presented in this paper. MUVITORKIT is based on EMF and GEF, and supports nested models, models needing multiple graphical viewers, and animated simulation of model behavior. The architecture of MUVITORKIT is designed in a way that encapsulates the complex underlying mechanisms in GEF and simplifies the integration in the ECLIPSE workbench.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/roneditor/files/MuvitorKit_GI09_long.pdf}
}
@inproceedings{MEE+09,
Title = {Modeling Communication Spaces with Higher-Order Petri Nets},
Author = {Tony Modica and Claudia Ermel and Hartmut Ehrig and Kathrin Hoffmann and Enrico Biermann},
Booktitle = {Advances in Multiagent Systems, Robotics and Cybernetics: Theory and Practice},
Pages = {43-48},
Year = {2009},
Isbn = {978-1-897233-61-0},
Address = {Tecumseh, Canada},
Volume = {III},
Editor = {George~E.~Lasker and Jochen Pfalzgraf},
Publisher = {The International Institute for Advanced Studies in Systems Research and Cybernetics},
Abstract = {Communication Spaces (CS) are intended to give a general view on communication-based systems that focuses on the actors and the relations among each other. One of the main aspects of CS is to take into account human-centric demands, e.g. adaption to environment and preferences, interpretation of content in contexts. Since most of the well-known formal modeling approaches are adequate only for specific aspects of CS, we advocate a new formal approach in this article: reconfigurable algebraic higher-order Petri nets with individual tokens (AHOI nets). This approach is an integration of the well-established modeling techniques Petri nets, algebras, and rule-based Petri net transformation (based on graph transformation). It is intended to cover the main aspects of CS and to analyze and verify properties specific to them. In this article, an informal introduction of the new approach is given and demonstrated on an example modeling of the widely known Internet telephone software Skype. This allows us to discuss the advantages of the new formal approach w.r.t. needs of modeling CS and how the new approach could be extended to support more advanced features of Skype and other CS.},
Keywords = {Communication Spaces, higher-order Petri nets, visual languages}
}
@techreport{MGE+10,
Title = {{L}ow- and {H}igh-{L}evel {P}etri {N}ets with {I}ndividual {T}okens},
Author = {Tony Modica and Karsten Gabriel and Hartmut Ehrig and Kathrin Hoffmann and Sarkaft Shareef and Claudia Ermel and Ulrike Golas and Frank Hermann and Enrico Biermann},
Year = {2010},
Isbn = {ISSN 1436-9915},
Number = {2009/13},
Note = {\url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}},
Institution = {Technische Universit\"at Berlin},
Abstract = {In this article, we present a new variant of Petri nets with markings called \engquote{Petri nets with individual tokens}, together with rule-based transformation following the double pushout approach. The most important change to former Petri net transformation approaches is that the marking of a net is no longer a \engquote{collective} set of tokens, but each each has an own identity leading to the concept of Petri nets with individual tokens. This allows us to formulate rules that can change the marking of a net arbitrarily without necessarily manipulating the structure. As a first main result that depends on nets with individual markings we show the equivalence of transition firing steps and the application of firing-simulating rules. We define categories of low-level and of algebraic high-level nets with individual tokens, called PTI nets and AHLI nets, respectively, and relate them with each other and their collective counterparts by functors. To be able to use the properties and analysis results of \MCAL{M}-adhesive HLR systems (formerly know as weak adhesive high-level replacement systems) we show in further main results that both categories of PTI nets and AHLI nets are \MCAL{M}-adhesive categories. By showing how to construct initial pushouts we also give necessary and sufficient conditions for the applicability of transformation rules in these categories, known as gluing condition in the literature.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}
}
@inproceedings{PEB00,
Title = {{Rule-Based and Visual Model Evolution using GenGEd}},
Author = {Padberg, J. and Ermel, C. and Bardohl, R.},
Booktitle = {Proc. Graph Transformations for Visual Modeling Techniques (Satellite Workshop of 27th Int. Colloqium on Automata, Languages, and Programming, ICALP'2000)},
Year = {2000},
Note = {Satellite Workshop of ICALP}
}
@inproceedings{PGE98,
Title = {Rule-{B}ased {R}efinement of {H}igh-{L}evel {N}ets {P}reserving {S}afety {P}roperties},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Booktitle = {Fundamental Approaches to Software Engineering},
Pages = {221--238},
Year = {1998},
Volume = {1382},
Editor = {Astesiano, E.},
Publisher = {SPRINGER},
Series = {LNCS}
}
@article{PGE01,
Title = {Rule-based refinement of high-level nets preserving safety properties},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Pages = {97--118},
Year = {2001},
Journal = {Science of Computer Programming},
Volume = {40},
Note = {\url{www.elsevier.nl/locate/scico}}
}
@techreport{PGE97,
Title = {{Refinement versus Verification: Compatibility of Net-Invariants and Stepwise Development of High-Level Petri Nets}},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Year = {1997},
Number = {97-22},
Note = {\url{http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html}},
Institution = {Technical University Berlin}
}
@inproceedings{PHE+07,
Title = {Maintaining Consistency in Layered Architectures of Mobile Ad-Hoc Networks},
Author = {Julia Padberg and Kathrin Hoffmann and Hartmut Ehrig and Tony Modica and Enrico Biermann and Claudia Ermel},
Booktitle = {Fundamental Approaches to Software Engineering},
Pages = {383--397},
Year = {2007},
Isbn = {978-3-540-71288-6},
Volume = {4422},
Editor = {Matthew B. Dwyer and Ant\´onia Lopes},
Publisher = {Springer},
Series = {LNCS},
Abstract = {In this paper we present a layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher order nets (AHO nets). manets are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure, e.g. in emergency scenarios, where an effective coordination is crucial among team members, each of them equipped with hand-held devices. Workflows in manets can be adequately modeled using a layered architecture, where the overall workflow, the team members� activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Dividing the AHO net model into layers immediately rises the question of consistency. We suggest a formal notion of layer consistency requiring that the team layer is given by the mapping of the individual member�s activities to the gluing of the workflow and the mobility layer. The main results concern the maintenance of the layer consistency when changing the workflow layer, the mobility layer and the team layer independently.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/PHE+07.pdf},
Keywords = {mobile ad-hoc network, Petri net, consistency, layered architecture}
}
@inproceedings{RDE+08,
Title = {{Ludo: A Case Study for Graph Transformation Tools}},
Author = {Rensink, A. and Dotor, A. and Ermel, C. and Jurack, S. and Kniemeyer, O. and {de Lara}, J. and Maier, S. and Staijen, T. and Z\"undorf, A.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Pages = {493--513},
Year = {2008},
Isbn = {ISBN-13: 978-3540890195},
Location = {Kassel, Germany},
Volume = {5088},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Publisher = {Springer},
Series = {LNCS},
Abstract = {In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Graph Transformation Tool Contest. After summarising the case description, we give an overview of the submitted solutions. In particular, we propose a number of dimensions along which choices had to be made when solving the case, essentially setting up a solution space; we then plot the spectrum of solutions actually encountered into this solution space. In addition, there is a brief description of the special features of each of the submissions, to do justice to those aspects that are not distinguished in the general solution space.},
Url = {http://www.springerlink.com/index/W87475326301H206.pdf},
Keywords = {graph transformation tool, Ludo, case study}
}
@inproceedings{RET12,
Title = {{AGG} 2.0 -- New Features for Specifying and Analyzing Algebraic Graph Transformations},
Author = {Runge, O. and Ermel, C. and Taentzer, G},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, 4th International Symposium, (AGTIVE'11), Proceedings},
Year = {2012},
Location = {Budapest, Hungary, October 4-7, 2011},
Volume = {7233},
Editor = {Andy Sch\"urr and Daniel Varro and Gergely Varro},
Publisher = {Springer},
Series = {LNCS},
Abstract = {The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependency detection in transformations by critical pair analysis of graph rules, an important instrument to support the confluence check of graph transformation systems. AGG 2.0 includes various new features added over the past two years. It supports the specification of complex control structures for rule application comprising the definition of control and object flow for rule sequences and nested application conditions. Furthermore, new possibilities for constructing rules from existing ones (e.g. inverse, minimal, amalgamated, and concurrent rules) and for more flexible usability of critical pair analyses have been realized.}
}
@inproceedings{TEHA13,
Title = {Towards refactoring of rule-based, in-place model transformation systems},
Author = {Taentzer, G and Arendt, T. and Ermel, C. and Heckel, R.},
Booktitle = {Proceedings of the First Workshop on the Analysis of Model Transformations (AMT'12)},
Year = {2013},
Isbn = {978-1-4503-1803-7},
Doi = {10.1145/2432497.2432506},
Location = {Innsbruck, Austria},
Address = {New York, NY, USA},
Editor = {Dingel, J. and Lucio, L. and Vangheluwe, H. and Varro, D.},
Publisher = {ACM},
Abstract = {The more model transformations are applied in various application domains, the more questions about their quality arise. In this paper, we present a first approach towards improving the quality of endogenous in-place model transformation systems. This kind of model transformations is typically rule-based and well suited to perform model simulations and optimizations. After discussing suitable quality aims for this kind of model transformation systems and how they can be detected by smells, a first selection of refactorings is presented showing a variety of potential improvements of model transformation systems. Each refactoring is presented in a systematic way including an explanation how the quality is improved, a description of its pre- and postconditions, a possible refactoring strategy, and an example. All discussed refactorings are implemented in Henshin, a model transformation engine based on graph transformation concepts, using Henshin in combination with the Eclipse plug-in EMF Refactor, a refactoring plug-in for defining and applying refactorings of EMF models.},
Url = {http://dl.acm.org/citation.cfm?id=2432497}
}
@inproceedings{TCSE08,
Title = {{Generating Domain-Specific Model Editors with Complex Editing Commands}},
Author = {Taentzer, G. and Crema, A. and Schmutzler, R. and Ermel, C.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Pages = {98--103},
Year = {2008},
Isbn = {ISBN-13: 978-3540890195},
Location = {Kassel, Germany},
Address = {Heidelberg},
Volume = {5088},
Editor = {A. Sch\"urr and M. Nagl and A. Z\"undorf},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of domain-specific solutions. Using the Eclipse Graphical Modeling Framework (GMF), modeling languages are defined by providing a meta model using the MOF/EMF approach. Up to now, GMF provides basic editing commands only. It does not support the definition of complex editing commands which would allow e.g. to insert a complex structure into a diagram in one step. As practical tool support for the design and generation of visual editors with complex editing operations based on graph transformation, an extended version of GMF has been developed and is presented in this paper.},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/TCSE08.pdf},
Keywords = {Eclipse, GMF, editor generation, graph transformation}
}
@inproceedings{TEHA12,
Title = {Towards Refactoring of Rule-Based, In-Place Model Transformation Systems},
Author = {Taentzer, G and Ermel, C. and Heckel, R. and Arendt, T.},
Booktitle = {Int. Workshop of Automated Model Transformations (AMT 2012)},
Year = {2012},
Abstract = {The more model transformations are applied in various application domains, the more questions about their quality arise. In this paper, we present a first approach towards improving the quality of endogenous in-place model transformation systems. This kind of model transformations is typically rule-based and well suited to perform model simulations and optimizations. After discussing suitable quality aims for this kind of model transformation systems and how they can be detected by smells, a first selection of refactorings is presented showing a variety of potential improvements of model transformation systems. Each refactoring is presented in a systematic way including an explanation how the quality is improved, a description of its pre- and post-conditions, a possible refactoring strategy, and an example. All discussed refactorings are implemented in Henshin, a model transformation engine based on graph transformation concepts, using Henshin in combination with the Eclipse plug-in Refactor, a refactoring plug-in for defining and applying refactorings of EMF models.}
}
@misc{TEHA11a,
Title = {{Towards Refactoring of Graph Transformation Systems -- Long Version}},
Author = {Taentzer, G and Ermel, C. and Heckel, R. and Arendt, T.},
Year = {2011},
Note = {To Appear as Technical Report at TU Berlin},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers11/TEHA11a.pdf}
}
@inproceedings{TELW10,
Title = {Conflict Detection for Model Versioning Based on Graph Modifications},
Author = {Taentzer, G. and Ermel, C. and Langer, P. and Wimmer, M.},
Booktitle = {Proc. of Int. Conf. on Graph Transformations (ICGT'10)},
Pages = {171--186},
Year = {2010},
Isbn = {ISSN 0302-9743},
Volume = {6372},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch\"urr, A.},
Publisher = {Springer},
Series = {LNCS},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Therefore, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems we present an approach which takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define model revisions as graph modifications which are not necessarily rule-based. Building up on the DPO approach to graph transformations, we define two different kinds of conflict detection: (1) the check for operation-based conflicts, and (2) the check for state-based conflicts on results of merged graph modifications.},
Url = {http://www.springerlink.com/content/vu72w565867k3716/}
}
@article{TELW14,
Title = {A fundamental approach to model versioning based on graph modifications: from theory to implementation},
Author = {Taentzer, Gabriele and Ermel, Claudia and Langer, Philip and Wimmer, Manuel},
Pages = {239-272},
Year = {2014},
Issn = {1619-1366},
Doi = {10.1007/s10270-012-0248-x},
Journal = {Software \& Systems Modeling},
Volume = {13},
Number = {1},
Publisher = {Springer Berlin Heidelberg},
Url = {http://dx.doi.org/10.1007/s10270-012-0248-x},
Keywords = {Model versioning; Graph modification; Conflict detection; Conflict resolution},
Language = {English}
}
@article{TELW12,
Title = {A fundamental approach to model versioning based on graph modifications: from theory to implementation},
Author = {Taentzer, Gabriele and Ermel, Claudia and Langer, Philip and Wimmer, Manuel},
Pages = {1-34},
Year = {2012},
Issn = {1619-1366},
Doi = {10.1007/s10270-012-0248-x},
Journal = {Software and Systems Modeling},
Publisher = {Springer-Verlag},
Abstract = {In model-driven engineering, models are primary artifacts that can evolve heavily during their life cycle. Therefore, versioning of models is a key technique to be offered by integrated development environments for model-driven engineering. In contrast to text-based versioning systems we present an approach that takes model structures and their changes over time into account. Considering model structures as graphs, we define a fundamental approach where model revisions are considered as graph modifications consisting of delete and insert actions. Two different kinds of conflict detection are presented: (1) the check for operation-based conflicts between different graph modifications, and (2) the check for state-based conflicts on merged graph modifications. For the merging of graph modifications, a two-phase approach is proposed: First, operational conflicts are temporarily resolved by always giving insertion priority over deletion to keep as much information as possible. Thereafter, this tentative merge result is the basis for manual conflict resolution as well as for the application of repair actions that resolve state-based conflicts. If preferred by the user, giving deletion priority over insertion might be one solution. The fundamental concepts are illustrated by versioning scenarios for simplified statecharts. Furthermore, we show an implementation of this fundamental approach to model versioning based on the Eclipse Modeling Framework as technical space.},
Url = {http://dx.doi.org/10.1007/s10270-012-0248-x},
Keywords = {Model versioning; Graph modification; Conflict detection; Conflict resolution},
Language = {English}
}
@techreport{TELW10a,
Title = {Conflict Detection for Model Versioning Based on Graph Modifications: Long Version},
Author = {Gabriele Taentzer and Claudia Ermel and Philip Langer and Manuel Wimmer},
Year = {2010},
Number = {2010/09},
Institution = {TU Berlin},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Therefore, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems we present an approach which takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define model revisions as graph modifications which are not necessarily rule-based. Building up on the DPO approach to graph transformations, we define two different kinds of conflict detection: (1) the check for operation-based conflicts, and (2) the check for state-based conflicts on results of merged graph modifications.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@inproceedings{ERT98,
Title = {{The {AGG}-Approach: Language and Tool Environment}},
Author = {Taentzer, G. and Ermel, C. and Rudolf, M.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, volume 2: Applications, Languages and Tools},
Pages = {551--603},
Year = {1999},
Editor = {Ehrig, H. and Engels, G. and Kreowski, H.-J. and Rozenberg, G.},
Publisher = {World Scientific}
}
@book{PNTVol02,
Title = {{Advances in Petri Nets: Petri Net Technology for Communication Based Systems}},
Year = {2003},
Issn = {ISSN 0302-9743, ISBN 3-540-20538-1},
Volume = {2472},
Editor = {Ehrig, H. and Reisig, W. and Rozenberg, G. and Weber, H.},
Publisher = {SPRINGER},
Series = {LNCS},
Keyy = {PNTVol03}
}
@book{KMO+05,
Title = {{Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday}},
Year = {2005},
Isbn = {ISSN 0302-9743},
Volume = {3393},
Editor = {Kreowski, H.-J. and Montanari, U. and Orejas, F. and Rozenberg, G. and Taentzer, G.},
Publisher = {SPRINGER},
Series = {LNCS},
Keyy = {KMO+05}
}