We present Computer Automated Multi-Paradigm Modelling (CAMPaM) (Mosterman and Vangheluwe 2002) for ModelDriven Development based on Meta-Modelling and Graph Transformation. The syntax of a class of models of interest is graphically meta-modelled in an appropriate formalism such as Entity-Relationship Diagrams. From this description of abstract syntax, augmented with concrete (visual) syntax in...

The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N -adhesive transformation systems, where N is a class of morphisms containing the...

Algebraic graph transformation is a well-known rule-based approach to manipulate graphs that can be applied in several contexts. In this paper we use it in the context of model-driven engineering. Graph transformation rules usually specify changes to only one graph per application, however there are use cases such as model co-evolution where not only a single graph should be manipulated but als...

Bidirectional model transformation plays an important role in maintaining consistency between two models, and has many potential applications in software development, including model synchronization, round-trip engineering, software evolution, multiple-view software development, and reverse engineering. However, unclear bidirectional semantics, weak bidirectionalization method, and lack of syst...

In this paper we give an overview of our approach for Model Driven Development (MDD), based on graph transformation techniques. In MDD, models are the primary assets in the development process. They are not only used for documentation, but also for analysis, simulation, code and test cases generation. Thus, model transformation becomes a central activity. As models can be formally described as ...

DIAPLAN is a language for programming with graphs representing diagrams that is currently being developed. The computational model of the languages, nested graph transformation, supports nested structuring of graphs, and graph variables, but is—hopefully—still intuitive. This paper is about structural typing of nested graphs and nested graph transformation systems by shape rules. We extend the ...

Diagrams and an Opfibration Account of Typed Graph Transformation R. Banach Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K. [email protected] A. Corradini Dipartimento di Informatica, Università di Pisa, Corso Italia 40, Pisa, Italy. [email protected] Abstract: The “in the large” properties of typed graph transformation systems in the double pushout framework and a d...

Various kinds of graph transformations and Petri net transformation systems are examples of M -adhesive transformation systems based on 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 tran...

Graphs and diagrams provide a simple and powerful approach variety of problems that are typical to computer science, for example for activities. In software development visual notation are used for modeling that including activity diagram, class diagram, control flow, graphs and some another diagrams. Models based on these notation can be seen a graph and graph transformation are involved. So A...