Skip to search formSkip to main contentSkip to account menu

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We in vestigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to… 
Highly Cited
2008
Highly Cited
2008
We propose a framework for the specification of behaviourpreserving reconfigurations of systems modelled as Petri nets. The… 
2008
2008
Good processability, thermal stability andgood mechanical properties make this class of materialsthe most valuable and frequently… 
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… 
Highly Cited
1999
Highly Cited
1999
Distributed systems demand a number of requirements on speciication techniques which do not have to be taken into account for the… 
Highly Cited
1997
Highly Cited
1997
A graph program consists of declarations of conditional graph transformation rules G. Rozenberg, editors: Handbook of Graph… 
Highly Cited
1996
Highly Cited
1996
We first give a new definition of graph grammars, which, although following the algebraic double-pushout approach, is more…