References of "Orejas, Fernando"
     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: 62 (5 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
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: 108 (1 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
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: 45 (3 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: 45 (5 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: 49 (4 UL)
Full Text
See detailEfficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars - Extended Version
Hermann, Frank UL; Ehrig, Hartmut; Golas, Ulrike et al

Report (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 relation database models. [less ▲]

Detailed reference viewed: 40 (2 UL)
Full Text
See detailFormal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars - Extended Version
Hermann, Frank UL; Ehrig, Hartmut; Orejas, Fernando et al

Report (2010)

Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model ... [more ▼]

Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour - especially local confluence - is missing up to now. In order to close this gap we generate forward translation rules, which extend standard forward rules by translation attributes keeping track of the elements which have been translated already. In the first main result we show the equivalence of model transformations based on forward resp. forward translation rules. This way, an additional control structure for the forward transformation is not needed. This allows to apply critical pair analysis and corresponding tool support by the tool AGG. However, we do not need general local confluence because confluence for source graphs not belonging to the source language is not relevant for the functional behaviour of a model transformation. For this reason we only have to analyze a weaker property, called translation confluence. This leads to our second main result, the functional behaviour of model transformations, which is applied to our running example, the model transformation from class diagrams to database models. [less ▲]

Detailed reference viewed: 42 (6 UL)
Full Text
Peer Reviewed
See detailFormal Analysis of Functional Behaviour of Model Transformations Based on Triple Graph Grammars
Hermann, Frank UL; Ehrig, Hartmut; Orejas, Fernando et al

in Graph Transformation (2010)

Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model ... [more ▼]

Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour is missing up to now. In order to close this gap we generate forward translation rules, which extend standard forward rules by translation attributes keeping track of the elements which have been translated already. In the first main result we show the equivalence of model transformations based on forward resp. forward translation rules. This way, an additional control structure for the forward transformation is not needed. This allows to apply critical pair analysis and corresponding tool support by the tool AGG. However, we do not need general local confluence, because confluence for source graphs not belonging to the source language is not relevant for the functional behaviour of a model transformation. For this reason we only have to analyze a weaker property, called translation confluence. This leads to our second main result, the functional behaviour of model transformations, which is applied to our running example, the model transformation from class diagrams to database models. [less ▲]

Detailed reference viewed: 30 (4 UL)
Full Text
Peer Reviewed
See detailIncremental Service Composition Based on Partial Matching of Visual Contracts
Naeem, Muhammad; Heckel, Reiko; Orejas, Fernando et al

in Fundamental Approaches to Software Engineering (2010)

Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requester may be able to use demand support for finding and ... [more ▼]

Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requester may be able to use demand support for finding and selecting services. In particular, it is unrealistic to expect that a single service will satisfy complex requirements, so services will have to be combined to match clients’ requests. In this paper, we propose a visual, incremental approach for the composition of services, in which we describe the requirements of a requester as a goal which is matched against multiple provider offers. After every match with an offer we decompose the goal into satisfied and remainder parts. We iterate the decomposition until the goal is satisfied or we run out of offers, leading to a resolution-like matching strategy. Finally, the individual offers can be composed into a single combined offer and shown to the requester for feedback. Our approach is based on visual specifications of pre- and postconditions by graph transformation systems with loose semantics, where a symbolic approach based on constraints is used to represent attributes and their computation in graphs. [less ▲]

Detailed reference viewed: 84 (3 UL)