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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2011
0120022011

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More… (More)
  • figure 9.1
  • figure 9.2
  • figure 9.3
  • figure 9.4
  • figure 9.5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved… (More)
Is this relevant?
2005
2005
  • Kimmo Nupponen, Jorma Tarhio, TEKNILLINEN KORKEAKOULU, DIPLOMITYÖN TIIVISTELMÄ
  • 2005
Model transformation is used in a wide range of applications including program synthesis , refactoring, and reverse engineering… (More)
  • figure 1.1
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved… (More)
Is this relevant?
2003
2003
  • P. BurmeisteC
  • 2003
The transformation of total graph structures has been studied from the algebraic point of view for more than two decades now, and… (More)
Is this relevant?
2002
2002
Invertible transformations can be used for realizing a system where development is done in different views, keeping the views… (More)
  • figure 4
  • figure 13
  • figure 14
  • figure 15
  • figure 16
Is this relevant?