Algebraic approaches to graph transformation–part II: Single pushout approach and comparison with double pushout approach
H Ehrig, R Heckel, M Korff, M Löwe… - Handbook Of Graph …, 1997 - World Scientific
The algebraic approaches to graph transformation are based on the concept of gluing of
graphs corresponding to pushouts in suitable categories of graphs and graph morphisms …
graphs corresponding to pushouts in suitable categories of graphs and graph morphisms …
Graph transformation for specification and programming
M Andries, G Engels, A Habel, B Hoffmann… - Science of Computer …, 1999 - Elsevier
The framework of graph transformation combines the potentials and advantages of both,
graphs and rules, to a single computational paradigm. In this paper we present some recent …
graphs and rules, to a single computational paradigm. In this paper we present some recent …
Tutorial introduction to graph transformation: A software engineering perspective
We give an introduction to graph transformation, not only for researchers in software
engineering, but based on applications of graph transformation in this domain. In particular …
engineering, but based on applications of graph transformation in this domain. In particular …
Ensuring consistency of conditional graph grammars-a constructive approach
R Heckel, A Wagner - Electronic Notes in Theoretical Computer Science, 1995 - Elsevier
Consistency conditions describe basic properties of graphs as eg the existence or
uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the …
uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the …
Graph transformation units with interleaving semantics
HJ Kreowski, S Kuske - Formal Aspects of Computing, 1999 - Springer
The aim of the paper is to introduce the notion of a transformation unit together with its
interleaving semantics and to study it as a means of constructing large graph transformation …
interleaving semantics and to study it as a means of constructing large graph transformation …
Encapsulated hierarchical graphs, graph types, and meta types
Currently existing graph grammar-based specification languages have serious problems
with supporting any kind of “specification-in-the-large” activities. More precisely, they have …
with supporting any kind of “specification-in-the-large” activities. More precisely, they have …
Stochastic simulation of graph transformation systems
Stochastic graph transformation systems (SGTS)[1] support integrated modelling of
architectural reconfiguration and non-functional aspects such as performance and reliability …
architectural reconfiguration and non-functional aspects such as performance and reliability …
Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
The classical algebraic approach to graph transformation is a mathematical theory based on
categorical techniques with several interesting applications in computer science. In this …
categorical techniques with several interesting applications in computer science. In this …
Horizontal and vertical structuring of typed graph transformation systems
Using a categorical semantics that has been developed recently as a basis, we study
composition and refinement as horizontal and vertical structuring techniques for typed graph …
composition and refinement as horizontal and vertical structuring techniques for typed graph …
Abstract hierarchical graph transformation
G Busatto, HJ Kreowski, S Kuske - Mathematical Structures in …, 2005 - cambridge.org
In this paper we introduce a new hierarchical graph model to structure large graphs into
small components by distributing the nodes (and, likewise, edges) into a hierarchy of …
small components by distributing the nodes (and, likewise, edges) into a hierarchy of …