References of "Ermel, Claudia"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailTowards the Propagation of Model Updates along different Views in Multi-View Models
Gottmann, Susann UL; Nachtigall, Nico UL; Ermel, Claudia et al

in Proceedings of the 5th International Workshop on Bidirectional Transformations (2016), 1571

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 119 (17 UL)
Full Text
See detailTriple Graph Grammars in the Large for Translating Satellite Procedures - Extended Version
Hermann, Frank UL; Gottmann, Susann UL; Nachtigall, Nico UL et al

Report (2014)

Software translation is a challenging task. Several requirements are important - including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability ... [more ▼]

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, wellde ned 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. [less ▲]

Detailed reference viewed: 251 (49 UL)
Full Text
Peer Reviewed
See detailTriple Graph Grammars in the Large for Translating Satellite Procedures
Hermann, Frank UL; Gottmann, Susann UL; Nachtigall, Nico UL et al

in Theory and Practice of Model Transformations (2014, July)

Software translation is a challenging task. Several requirements are important – including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability ... [more ▼]

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, well-defined 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. [less ▲]

Detailed reference viewed: 289 (39 UL)
Full Text
Peer Reviewed
See detailTowards Bidirectional Engineering of Satellite Control Procedures Using Triple Graph Grammars
Gottmann, Susann UL; Hermann, Frank UL; Ermel, Claudia et al

in Jacquet, Christophe; Balasubramanian, Daniel; Jones, Edward (Eds.) et al Proc. Int. Workshop on Multi-Paradigm Modeling 2013 (MPM'13) (2013)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 85 (21 UL)
Full Text
Peer Reviewed
See detailCorrectness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars
Gottmann, Susann UL; Hermann, Frank UL; Nachtigall, Nico UL et al

in Baudry, Benoit; Dingel, Juergen; Lucio, Levi (Eds.) et al Proc. Int. Workshop on Analysis of Model Transformations 2013 (AMT'13) (2013)

Detailed reference viewed: 101 (19 UL)
Full Text
Peer Reviewed
See detailConcurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars
Hermann, Frank UL; Ehrig, Hartmut; Ermel, Claudia

in J. de Lara, A. Zisman (Ed.) Fundamental Approaches to Software Engineering (2012)

Triple graph grammars (TGGs) have been used successfully to analyse correctness of bidirectional model transformations. Recently, also a corresponding formal approach to model synchronization has been ... [more ▼]

Triple graph grammars (TGGs) have been used successfully to analyse correctness of bidirectional model transformations. Recently, also a corresponding formal approach to model synchronization has been presented, where updates on a given domain (either source or target) can be correctly (forward or backward) propagated to the other model. However, a corresponding formal approach ofconcurrentmodel 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 result, we showcorrectnessof concurrent model synchronization, that is, 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 result, we showcompatibilityof concurrent with basic model synchronization: concurrent model synchronization can realize both forward and backward propagation. The results are illustrated by a running example on updating organizational models. [less ▲]

Detailed reference viewed: 73 (7 UL)
Full Text
Peer Reviewed
See detailVisual Modeling and Analysis of EMF Model Transformations based on Triple Graph Grammars
Ermel, Claudia; Hermann, Frank UL; Gall, Jürgen et al

in Electronic Communications of the EASST (2012)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 86 (7 UL)
Full Text
See detailConcurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars-Extended Version
Hermann, Frank UL; Ehrig, Hartmut; Ermel, Claudia et al

Report (2011)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 55 (4 UL)
Full Text
See detailLow- and High-Level Petri Nets with Individual Tokens
Modica, Tony; Gabriel, Karsten; Ehrig, Hartmut et al

Report (2010)

In this article, we present a new variant of Petri nets with markings called Petri nets with individual tokens, together with rule-based transformation following the double pushout approach. The most ... [more ▼]

In this article, we present a new variant of Petri nets with markings called 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 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 \MCALM-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 \MCALM-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. [less ▲]

Detailed reference viewed: 94 (4 UL)
Full Text
See detailBehaviour Simulation and Equivalence of Systems Modelled by Graph Transformation
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL et al

in Bulletin of the EATCS (2009), 97

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 41 (1 UL)
Full Text
Peer Reviewed
See detailTransformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
Hermann, Frank UL; Ehrig, Hartmut; Ermel, Claudia

in Wirsing, Martin; Chechik, C. (Eds.) Proc. International Conference on Fundamental Aspects of Software Engineering (FASE'09) (2009)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 70 (1 UL)
Full Text
See detailOn-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars: Long Version
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL et al

Report (2009)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 39 (1 UL)
Full Text
Peer Reviewed
See detailOn-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL et al

in Schürr, Andy; Selic, Bran (Eds.) ACM/IEEE 12th Int. Conf. on Model Driven Engineering Languages and Systems (MODELS'09) (2009)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 62 (1 UL)
Full Text
See detailTransformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (Long Version)
Hermann, Frank UL; Ehrig, Hartmut; Ermel, Claudia

Report (2008)

E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main ... [more ▼]

E-government services usually process large amounts of confidential 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 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 parallel critical pattern detection and elimination. [less ▲]

Detailed reference viewed: 29 (2 UL)
Peer Reviewed
See detailOn the Relationship of Model Transformations Based on Triple and Plain Graph Grammars
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL

in Karsai, Gabor; Taentzer, Gabriele (Eds.) Proc. Third International Workshop on Graph and Model Transformation (2008)

Detailed reference viewed: 46 (1 UL)
Full Text
See detailOn the Relationship of Model Transformations Based on Triple and Plain Graph Grammars (Long Version)
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL

Report (2008)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 23 (2 UL)
Peer Reviewed
See detailInformation Preserving Bidirectional Model Transformations
Ehrig, Hartmut; Ehrig, Karsten; Ermel, Claudia et al

in Dwyer, Matthew B.; Lopes, Antonia (Eds.) Fundamental Approaches to Software Engineering (2007)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 64 (2 UL)
Peer Reviewed
See detailA Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework
Biermann, Enrico; Ermel, Claudia; Hermann, Frank UL et al

in Juhas, G.; Desel, J. (Eds.) Proc. 14th Workshop on Algorithms and Tools for Petri Nets (AWPN'07) (2007)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 52 (2 UL)