Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Computer scienceGraph rewriting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Graphs , rewriting and causality in rule-based models
The Kappa calculus defines how a graph, representing a system of linked agents, can be modified by rules that specify which… 
2004
2004
Derivations in Object-Oriented Graph Grammars
This work aims to extend the algebraic single-pushout approach to graph transformation to model object-oriented systems… 
2004
2004
Single-Pushout Transformation Of Total Algebras
We characterize the pairs of partial homomorphisms of total Σ-algebras that have a pushout in the corresponding category, for an… 
1999
1999
Algebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach
1994
1994
Parallelism in single-pushout graph rewriting
The single-pushout approach to graph transformation comes equipped with an interesting parallel composition of rules and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)