References of "Ehrig, Hartmut"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailFormal Analysis of Model Transformations Based on Triple Graph Grammars
Hermann, Frank UL; Ehrig, Hartmut; Golas, Ulrike et al

in Mathematical Structures in Computer Science (2014), 24(4-08), 1-57

Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an ... [more ▼]

Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation of operational rules for forward and backward model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we present several important results for analysing model transformations based on the formal categorical foundation of TGGs within the framework of attributed graph transformation systems. Our first main result shows that the crucial properties of correctness and completeness are ensured for model transformations. In order to analyse functional behaviour, we generate a new kind of operational rule, called a forward translation rule. We apply existing results for the analysis of local confluence for attributed graph transformation systems. As additional main results, we provide sufficient criteria for the verification of functional behaviour as well as a necessary and sufficient condition for strong functional behaviour. In fact, these conditions imply polynomial complexity for the execution of the model transformation. We also analyse information and complete information preservation of model transformations, that is, whether a source model can be reconstructed (uniquely) from the target model computed by the model transformation. We illustrate the results for the well-known model transformation example from class diagrams to relational database models. [less ▲]

Detailed reference viewed: 69 (5 UL)
Full Text
Peer Reviewed
See detailAnalysis of Permutation Equivalence in M-adhesive Transformation Systems with Negative Application Conditions
Hermann, Frank UL; Ehrig, Hartmut; Corradini, Andrea

in Mathematical Structures in Computer Science (2014), 24(4-09), 1-47

M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and ... [more ▼]

M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs such as attribution as in the case of typed attributed graphs. In the current paper, we investigate -adhesive transformation systems including negative application conditions (NACs) for transformation rules, which are often used in applications. For such systems, we propose an original equivalence on transformation sequences, called permutation equivalence, that is coarser than the classical switch equivalence. We also present a general construction of deterministic processes for -adhesive transformation systems based on subobject transformation systems. As a main result, we show that the process obtained from a transformation sequence identifies its equivalence class of permutation-equivalent transformation sequences. Moreover, we show how the analysis of this process can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies between rule applications of the transformation sequence, including the inhibiting effects of the NACs. [less ▲]

Detailed reference viewed: 66 (10 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: 243 (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: 268 (39 UL)
Full Text
Peer Reviewed
See detailModel synchronization based on triple graph grammars: correctness, completeness and invertibility
Hermann, Frank UL; Ehrig, Hartmut; Orejas, Fernando et al

in Software & Systems Modeling (2013)

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

Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations. They are generated from a given TGG, which specifies the language of all consistently integrated source and target models. As our main result, we show that the generated synchronization framework is correct and complete, provided that forward and backward propagation operations are deterministic. Correctness essentially means that the propagation operations preserve and establish consistency while completeness ensures that the operations are defined for all possible inputs. Moreover, we analyze the conditions under which the operations are inverse to each other. All constructions and results are motivated and explained by a running example, which leads to a case study, using concrete visual syntax and abstract syntax notation based on typed attributed graphs. [less ▲]

Detailed reference viewed: 105 (23 UL)
Full Text
Peer Reviewed
See detailOn Propagation-Based Concurrent Model Synchronization
Orejas, Fernando; Boronat, Artur; Ehrig, Hartmut et al

in Electronic Communications of the EASST (2013), 57

Model transformations based on triple graph grammars (TGGs) have been applied in several practical case studies and they convince by their intuitive and descriptive way of specifying bidirectional model ... [more ▼]

Model transformations based on triple graph grammars (TGGs) have been applied in several practical case studies and they convince by their intuitive and descriptive way of specifying bidirectional model transformations. Moreover, fundamental properties have been extensively studied including syntactical correctness, completeness, termination and functional behaviour. But up to now, it is an open problem how domain specific properties that are valid for a source model can be preserved along model transformations such that the transformed properties are valid for the derived target model. In this paper, we analyse in the framework of TGGs how to propagate constraints from a source model to an integrated and target model such that, whenever the source model satisfies the source constraint also the integrated and target model satisfy the corresponding integrated and target constraint. In our main new results we show under which conditions this is possible. The case study shows how this result is successfully applied for the propagation of security constraints in enterprise modelling between business and IT models. [less ▲]

Detailed reference viewed: 84 (6 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: 98 (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: 56 (7 UL)
Full Text
Peer Reviewed
See detailSatisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories
Schölzel, Hanna; Ehrig, Hartmut; Maximova, Maria et al

in Electronic Proceedings in Theoretical Computer Science [=EPTCS] (2012), 93

Application conditions for rules and constraints for graphs are well-known in the theory of graph transformation and have been extended already to M-adhesive transformation systems. According to the ... [more ▼]

Application conditions for rules and constraints for graphs are well-known in the theory of graph transformation and have been extended already to M-adhesive transformation systems. According to the literature we distinguish between two kinds of satisfaction for constraints, called general and initial satisfaction of constraints, where initial satisfaction is defined for constraints over an initial object of the base category. Unfortunately, the standard definition of general satisfaction is not compatible with negation in contrast to initial satisfaction. Based on the well-known restriction of objects along type morphisms, we study in this paper restriction and amalgamation of application conditions and constraints together with their solutions. In our main result, we show compatibility of initial satisfaction for positive constraints with restriction and amalgamation, while general satisfaction fails in general. Our main result is based on the compatibility of composition via pushouts with restriction, which is ensured by the horizontal van Kampen property in addition to the vertical one that is generally satisfied in M-adhesive categories [less ▲]

Detailed reference viewed: 52 (3 UL)
Full Text
Peer Reviewed
See detailParallelism and Concurrency of Stochastic Graph Transformations
Heckel, Reiko; Ehrig, Hartmut; Golas, Ulrike et al

in Graph Transformation, Lecture Notes in Computer Science (LNCS) (2012), 7562

Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as ... [more ▼]

Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Parallelism and Concurrency Theorems and their application to computing the completion time of a concurrent process. [less ▲]

Detailed reference viewed: 56 (3 UL)
Full Text
Peer Reviewed
See detailFormal Specification of Model Transformations by Triple Graph Grammars with Application Conditions
Golas, Ulrike; Ehrig, Hartmut; Hermann, Frank UL

in Electronic Communications of the EASST (2011), 39

Triple graph grammars are a successful approach to describe exogenous model transformations, i.e. transformations between models conforming to different meta-models. Source and target models are related ... [more ▼]

Triple graph grammars are a successful approach to describe exogenous model transformations, i.e. transformations between models conforming to different meta-models. Source and target models are related by some connection part, triple rules describe the simultaneous construction of these parts, and forward and backward rules can be derived modeling the forward and backward model transformations. As shown already for the specification of visual models by typed attributed graph transformation, the expressiveness of the approach can be enhanced significantly by using application conditions, which are known to be equivalent to first order logic on graphs. In this paper, we extend triple rules with a specific form of application conditions, which enhance the expressiveness of formal specifications for model transformations. We show how to extend results concerning information preservation, termination, correctness, and completeness of model transformations to the case with application conditions. We illustrate our approach and results with a model transformation from statecharts to Petri nets. [less ▲]

Detailed reference viewed: 32 (1 UL)
Full Text
See detailCorrectness of Model Synchronization Based on Triple Graph Grammars - Extended Version
Hermann, Frank UL; Ehrig, Hartmut; Orejas, Fernando et al

Report (2011)

Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and ... [more ▼]

Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and finally to implementation code. This paper presents model transformation and model integration as specific problem within bidirectional model transformation, which has shown to support various purposes, such as analysis, optimization, and code generation. The main purpose of model integration is to establish correspondence between various models, especially between source and target models. From the analysis point of view, model integration supports correctness checks of syntactical dependencies between different views and models. The overall concept is based on the algebraic approach to triple graph grammars, which are widely used for model transformation. The main result shows the close relationship between model transformation and model integration. For each model transformation sequence there is a unique model integration sequence and vice versa. This is demonstrated by a quasi-standard example for model transformation between class models and relational data base models. [less ▲]

Detailed reference viewed: 50 (4 UL)
Full Text
Peer Reviewed
See detailCorrectness of Model Synchronization Based on Triple Graph Grammars
Hermann, Frank UL; Ehrig, Hartmut; Orejas, Fernando et al

in Model Driven Engineering Languages and Systems (2011)

Detailed reference viewed: 49 (5 UL)
Full Text
Peer Reviewed
See detailFrom State- to Delta-Based Bidirectional Model Transformations: The Symmetric Case
Diskin, Zinovy; Xiong, Yingfei; Czarnecki, Krzysztof et al

in Model Driven Engineering Languages and Systems (2011)

Detailed reference viewed: 49 (3 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: 53 (4 UL)
Full Text
See detailFrom state- to delta-based bidirectional model transformations: the symmetric case
Diskin, Zinovy; Xiong, Yingfei; Czarnecki, Krzysztof et al

Report (2011)

Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and ... [more ▼]

Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and finally to implementation code. This paper presents model transformation and model integration as specific problem within bidirectional model transformation, which has shown to support various purposes, such as analysis, optimization, and code generation. The main purpose of model integration is to establish correspondence between various models, especially between source and target models. From the analysis point of view, model integration supports correctness checks of syntactical dependencies between different views and models. The overall concept is based on the algebraic approach to triple graph grammars, which are widely used for model transformation. The main result shows the close relationship between model transformation and model integration. For each model transformation sequence there is a unique model integration sequence and vice versa. This is demonstrated by a quasi-standard example for model transformation between class models and relational data base models. [less ▲]

Detailed reference viewed: 112 (1 UL)
Full Text
Peer Reviewed
See detailPropagation of Constraints along Model Transformations Based on Triple Graph Grammars
Ehrig, Hartmut; Hermann, Frank UL; Schölzel, Hanna et al

in Electronic Communications of the EASST (2011), 41

Detailed reference viewed: 41 (2 UL)
Full Text
See detailEfficient Process Analysis of Transformation Systems Based on Petri nets
Hermann, Frank UL; Corradini, Andrea; Ehrig, Hartmut et al

Report (2010)

In the framework of adhesive transformation systems with Negative Application Conditions (NACs), we show how the problem of computing the set of equivalent derivations to a given one can be reduced to the ... [more ▼]

In the framework of adhesive transformation systems with Negative Application Conditions (NACs), we show how the problem of computing the set of equivalent derivations to a given one can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies among rule applications of the derivation, including the inhibiting e ects of the NACs. We show the e ectiveness of this approach by comparing the cost of a brute force-approach with the cost of the presented analysis applied to a derivation of a simple system, showing a signi cant improvement in speed. [less ▲]

Detailed reference viewed: 35 (1 UL)
Full Text
Peer Reviewed
See detailEfficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars
Hermann, Frank UL; Ehrig, Hartmut; Golas, Ulrike et al

in Bézivin, Jean; Soley, R.M.; Vallecillo, A. (Eds.) Proc. Int. Workshop on Model Driven Interoperability (MDI'10) (2010)

Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and analysis of bidirectional model transformations. In previous work we have formalized and analyzed ... [more ▼]

Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and analysis of bidirectional model transformations. In previous work we have formalized and analyzed already termination, correctness, completeness, local confluence and functional behaviour. In this paper, we show how to improve the efficiency of the execution and analysis of model transformations in practical applications by using triple rules with negative application conditions (NACs). In addition to specification NACs, which improve the specification of model transformations, the generation of filter NACs improves the efficiency of the execution and the analysis of functional behaviour supported by critical pair analysis of the tool AGG. We illustrate the results for the well-known model transformation from class diagrams to relational database models. [less ▲]

Detailed reference viewed: 40 (1 UL)
Full Text
See detailEnterprise Modelling using Algebraic Graph Transformation - Extended Version
Brandt, Christoph; Hermann, Frank UL; Ehrig, Hartmut et al

Report (2010)

An analysis of today's situation at Credit Suisse has shown severe problems, because it is based on current best practices and ad-hoc modelling techniques to handle important aspects of security, risk and ... [more ▼]

An analysis of today's situation at Credit Suisse has shown severe problems, because it is based on current best practices and ad-hoc modelling techniques to handle important aspects of security, risk and compliance. Based on this analysis we propose in this paper a new enterprise model which allows the construction, integration, transformation and evaluation of di erent organizational models in a big decentralized organization like Credit Suisse. The main idea of the new model framework is to provide small decentralized models and intra-model evaluation techniques to handle services, processes and rules separately for the business and IT universe on one hand and for human-centric and machine-centric concepts on the other hand. Furthermore, the new framework provides inter-modelling techniques based on algebraic graph transformation to establish the connection between di erent kinds of models and to allow integration of the decentralized models. In order to check for security, risk and compliance in a suitable way, our models and techniques are based on di erent kinds of formal methods. In this paper, we show that algebraic graph transformation techniques are useful not only for intra-modelling { using graph grammars for visual languages and graph constraints for requirements { but also for inter-modelling { using triple graph grammars for model transformation and integration. Altogether, we present the overall idea of our new model framework and show how to solve speci c problems concerning intra- and inter-modelling as rst steps. This should give evidence that our framework can also ? This work is partially supported by Credit Suisse (Luxembourg) S.A., 56, Grand Rue BP 40, L-1660 Luxembourg, Telephone: +352 46 00 11-1, Fax: +352 46 32 70 handle important other requirements for enterprise modelling in a big decentralized organization like Credit Suisse. [less ▲]

Detailed reference viewed: 42 (3 UL)