Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

A typed attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams Hermann, Frank ; ; in Varro, Daniel; Bruni, Roberto (Eds.) Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'06) (2008) According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of ... [more ▼] According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of the abstract syntax of UML class and sequence diagrams based on the well-defined theory of typed attributed graph transformation with inheritance and application conditions. The generated language covers all important features of these parts of UML diagrams and is shown to satisfy all of the corresponding constraints by construction. An explicit model transformation demonstrates the close correspondence between the graph grammar and the MOF definition of UML class and sequence diagrams. The graph grammar is validated by well-established benchmarks showing that all important features of the MOF definition of UML are covered. This formal constructive syntax definition of UML class and sequence diagrams is the basis for syntax directed editing, formal analysis, formal operational and denotational semantics and correctness of model transformations. [less ▲] Detailed reference viewed: 115 (4 UL)On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars ; ; Hermann, Frank in Karsai, Gabor; Taentzer, Gabriele (Eds.) Proc. Third International Workshop on Graph and Model Transformation (2008) Detailed reference viewed: 79 (1 UL)Subobject Transformation Systems ; Hermann, Frank ; in Applied Categorical Structures (2008), 16(3), 389--419 Subobject transformation systems STS are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be ... [more ▼] Subobject transformation systems STS are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church�Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree. [less ▲] Detailed reference viewed: 92 (1 UL)Process Definition using Subobject Transformation Systems Hermann, Frank ; in Bulletin of the EATCS (2008), 95 Process definition on the basis of graph transformation systems was introduced by the concept of occurrence grammars, which are a generalization of Petri net processes given by occurrence nets. Recently ... [more ▼] Process definition on the basis of graph transformation systems was introduced by the concept of occurrence grammars, which are a generalization of Petri net processes given by occurrence nets. Recently, subobject transformation systems were proposed as abstract framework for occurrence grammars in adhesive categories, but they are still restricted to injective matches for graph transformation steps. In this paper we review the construction of STSs as processes for plain graph grammars and discuss an extension to attributed graph grammars with non-injective matches. This is the basis for a forthcoming formal treatment in the framework of adhesive categories. [less ▲] Detailed reference viewed: 55 (1 UL)From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars (Long Version) ; ; Hermann, Frank Report (2008) 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 (2 UL)A Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework ; ; Hermann, Frank 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: 87 (2 UL)Simulating Multi-graph Transformations Using Simple Graphs Hermann, Frank ; ; et al in Workshop on Graph Transformation and Visual Modelling Techniques (GT-VMT'07) (2007) Application of graph transformations for software verification and model transformation is an emergent field of research. In particular graph transformation approaches provide a natural way of modelling ... [more ▼] Application of graph transformations for software verification and model transformation is an emergent field of research. In particular graph transformation approaches provide a natural way of modelling object oriented systems and semantics of object-oriented languages. There exist a number of tools for graph transformations that are often specialised in a particular kind of graphs and/or graph transformation approaches, depending on the desired application domain. The main drawback of this diversity is the lack of interoperability. In this paper we show how (typed) multigraph production systems can be translated into (typed) simple-graph production systems. The presented construction enables the use of multigraphs with DPO transformation approach in tools that only support simple graphs with SPO transformation approach e.g. the GROOVE tool. [less ▲] Detailed reference viewed: 58 (2 UL)Information Preserving Bidirectional Model Transformations ; ; 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: 111 (2 UL)Towards Translating Graph Transformation Systems by Model Transformation ; Hermann, Frank ; in Proc. Int. Workshop on Graph and Model Transformation (GraMoT'06) (2006) Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars written in one approach to a ... [more ▼] Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars written in one approach to a behaviourally equivalent graph grammar in another approach. In this paper we translate graph grammars developed with the GROOVE tool to AGG graph grammars by first investigating the set of core graph transformation concepts supported by both tools. Then, we define what it means for two graph grammars to be behaviourally equivalent, and for the regar/ded approaches we actually show how to handle different definitions of both - application conditions and graph structures. The translation itself is explained by means of intuitive examples. [less ▲] Detailed reference viewed: 54 (2 UL)Sesqui-Pushout Rewriting ; ; Hermann, Frank et al in Graph Transformation (2006) Sesqui-pushout (sqpo) rewriting – ''sesqui´´ means ``one and a half'' in Latin – is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative ... [more ▼] Sesqui-pushout (sqpo) rewriting – ''sesqui´´ means ``one and a half'' in Latin – is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model ``deletion in unknown context'', a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between sqpo and the classical dpo and spo approaches. [less ▲] Detailed reference viewed: 122 (2 UL)A typed attributed Graph Grammar for syntax-directed editing of UML Sequence Diagrams Hermann, Frank Report (2006) 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: 91 (4 UL) |
||