Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
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 ...
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...