Single pushout graph rewriting

Known as: Single-pushout approach

In computer science, single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

The paper extends single-pushout graph transformation by polymorphism, a key concept in object-oriented design. The notions sub…

2012

The Kappa calculus defines how a graph, representing a system of linked agents, can be modified by rules that specify which…

2005

This paper shall give an introduction into the theory of rule-based graph transformation which is itself a well-studied area in…

2004

This work aims to extend the algebraic single-pushout approach to graph transformation to model object-oriented systems…

2004

We characterize the pairs of partial homomorphisms of total Σ-algebras that have a pushout in the corresponding category, for an…

1999

1998

We investigate and compare four variants of the double-pushout approach to graph transformation. Besides the traditional approach…

1996

Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types of…

1994

The single-pushout approach to graph transformation comes equipped with an interesting parallel composition of rules and…