Single pushout graph rewriting
Semantic Scholar uses AI to extract papers important to this topic.
The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application… (More)
The Kappa calculus defines how a graph, repre-<lb>senting a system of linked agents, can be modified by rules<lb>that specify… (More)
Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are… (More)
Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen… (More)
- Electr. Notes Theor. Comput. Sci.
It belongs to the folklore that graph grammars can be seen as a proper generalisation of Petri nets. In this paper we show how… (More)
- Int. J. Found. Comput. Sci.
We characterize the pairs of partial homomorphisms of total Σ-algebras that have a pushout in the corresponding category, for an… (More)
The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary… (More)
Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types of… (More)
The single-pushout approach to graph transformation interprets a double-pushout transformation rule of the classical algebraic… (More)
ion levels. The formal de nition of this concept which can be found in e.g. [Bey92] regards graphs as a set of objects with three… (More)