Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Double pushout graph rewriting

Known as: Double-pushout approach 
In computer science, double pushout graph rewriting or (DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Sesqui-pushout (SqPO) rewriting provides a variant of transformations of graph-like and other types of structures that fit into… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More… Expand
  • figure 9.1
  • figure 9.2
  • figure 9.3
  • figure 9.4
  • figure 9.5
Is this relevant?
2010
2010
We in vestigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to… Expand
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Sesqui-pushout (SqPO) rewriting-sesqui means one and a half in Latin-is a new algebraic approach to abstract rewriting in any… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract The present experiment was designed to evaluate the effect of spawning season rearing temperature and post-ovulatory… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2004
2004
This paper presents a framework for constructing hierarchical (hyper)graphs, using one of the well-known categories of… Expand
Is this relevant?
2003
2003
Eliciting the requirements for a proposed system typically involves different stakeholders with different expertise… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the… Expand
  • figure 31
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A graph program consists of declarations of conditional graph transformation rules G. Rozenberg, editors: Handbook of Graph… Expand
Is this relevant?
1993
1993
Abstract We introduce hyperedge replacement jungle rewriting, a graph-rewriting formalism suitable for modeling the manipulation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?