Modelling complex systems by graph transformation, we face scalability challenges both in our ability to create and understand these models and in the ability of tools to analyse them. To address these problems we propose to model graph transformation systems in views which can be understood and analysed separately. In particular, we show that transition systems can be generated separately for ...

We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the unfolding semantics and it generalises McMillan’s complete prefix approach, originally developed for Petri nets, to graph transformation systems. It allows to check properties of the graphs reachable in the system, expr...

Graph transformation is one of the key concepts in graph grammar. In order to accelerate the graph transformation, the concept of parallel graph transformation has been proposed by different tools such as AGG tool. The theory of parallel graph transformation used by AGG just allows clarifying the concepts of conflict and dependency between the transformation rules. This work proposes an approac...

Model-driven Software Engineering is one of the most focused research fields. Model processors automatically generate the lower level artefacts. Graph transformation is a widely used technique for model transformations. Especially visual model transformations can be expressed by graph transformations. This paper presents a visual control flow support of the Visual Modelling and Transformation S...

Techniques for the verification of structural invariants in graph transformation systems typically rely on the derivation of negative application conditions that are attached to graph transformation rules in order to avoid the runtime occurrence of forbidden structural patterns in the system model. In this paper, we propose a practical approach for this derivation process, which produces the re...

Interconnected data or, in particular, graph structures are a valuable source of information. Gaining insights and knowledge from is applied throughout wide range application areas, for which efficient tools desired. In this work we present an open Java transformation framework. The framework provides simple fluent Application Programming Interface (API) to transform provided structure desired ...

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 goal of this paper is the generalization of embedding and confluence results for graph transformation systems to transformation systems with negative application conditions (NACs). These conditions restrict the application of a rule by expressing that a specific structure must not be present before or after applying the rule to a certain context. Such a condition influences each rule applic...

A test oracle predicts expected outcomes for a set of test cases, often based on a formal, executable specification. Visual contracts are graph transformation rules describing preand post-conditions of a service’s operations. To obtain an oracle based on visual contracts, we use the Attributed Graph Grammar System (AGG) to execute the rules, creating a simulation of the behaviour expected of th...