The language Grace is being proposed for specifying and programming in a graph-centered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structur-ing of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units deene comp...

The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence of graphs with common critical exponents, and with connective constants converging geometrically to the golden mean. We consider the application of the Fishe...

The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavi...

Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations wrt. functional behavior and correctness, a for...

In this technical report we study the transformation of models in the context of algebraic graph transformation and triple graph grammars. The new contribution of the report is to define and analyze the transformation of model fragments in general and the propagtion of graph constraints in particular. With the borrowed context we developed a technique further to the model transformation with tr...

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 grap...

Graph transformation systems or graph grammars are a generalization of formal grammars used in linguistics.One of principal differences is that the structures that are transformed by transformation rules are no more linear. In this paper we consider graph transformation systems in connection with proof theory. We develop the graph transformation framework, where the attributes are derivable jud...

Applying an attributed graph transformation rule to a given object graph always implies some kind of constraint solving. In many cases, the given constraints are almost trivial to solve. For instance, this is the case when a rule describes a transformation G ⇒ H, where the attributes of H are obtained by some simple computation from the attributes of G. However there are many other cases where ...

The set of operations in state-of-the-art graph transformation tools allows one to conditionally create and remove nodes and edges from input graphs. Node attributes can be initialized or updated with information from other attributes, parameters or constants. These operations appear to be too restricted for expressing model refinements in a concise manner. More specifically, graph transformati...

Graph transformation systems are widely recognized as a powerful formalism for the specification of concurrent and distributed systems. Therefore, the need emerges naturally of developing formal concurrent semantics for graph transformation systems allowing for a suitable description and analysis of their computational properties. The aim of this chapter is to review and compare various concurr...