In this paper we present a model transformation from a visual representation (VisualOCL) of the Object Constraint Language (OCL) to the textual one using graph transformation. Starting from VisualOCL diagrams, we show how their underlying abstract syntax can be modeled by typed attributed graphs and converted into an OCL string representation using graph transformation rules.

Reversible circuits provide the subject of a new promising direction of circuit design. Reversible circuits are cascades of reversible gates specifying bijective functions on Boolean vectors. As one encounters quite a variety of reversible gates in the literature, there are many classes of reversible circuits. Two main problems are considered: (1) How can circuits of one class be transformed in...

In this paper, we reconsider an old and simple notion of parallel graph transformation and point out various perspectives concerning the parallel generation of graph languages, the parallelization of graph algorithms, the parallel transformation of infinite graphs, and parallel models of computation.

In this paper we present a concept of a rigorous approach that provides a formal semantics for a fundamental subset of UML. This semantics is derived by translating a given UML model into a graph transformation system, allowing modelers to actually execute their UML model. The graph transformation system comprises graph transformation rules and a working graph which represents the current state...

We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to differen...

In this paper we introduce a graph rewriting language, called Graph Rewriting and Transformation (GReAT), and a code generator tool, which together provide a programming framework for the specification and efficient realization of graph rewriting systems. We argue that the performance problems frequently associated with the implementation of the transformation can be significantly reduced by ad...

We introduce an analysis method that checks for the absence of (Euler) paths or cycles in the set of graphs reachable from a start graph via graph transformation rules. This technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. An important application is deadlock analysis in distributed systems.

Stochastic Graph Transformation combines the benefits of graphical modelling with stochastic analysis techniques. In this paper we report on our framework Sma for Stochastic Modelling and Analysis, and SGT , a tool which uses the framework for Stochastic Graph Transformation.

A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation to...

Polyglot-persistence applications use a combination of many diferent data stores. Often, one of them is a graph database to model relationships between data items. The data-transformation language NotaQL can be used to deĄne transformations from one NoSQL database to a diferent one. In this paper, we present a language extension for NotaQL to allow graph transformations, graph analysis, and dat...