FAQ

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

Topic mentions per year

Topic mentions per year

1993-2014
01219932014

Related topics

Related topics

2 relations
Computer science

Broader (1)

Graph rewriting

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Single pushout graph rewriting
Computer science
Graph rewriting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Reversible Sesqui-Pushout Rewriting
The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
Graphs, rewriting and causality in rule-based models
The Kappa calculus defines how a graph, repre-<lb>senting a system of linked agents, can be modified by rules<lb>that specify… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
Towards Theorem Proving Graph Grammars using Event-B
Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
GrGen: A Fast SPO-Based Graph Rewriting Tool
Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2005
2005
Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs
It belongs to the folklore that graph grammars can be seen as a proper generalisation of Petri nets. In this paper we show how… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
Is this relevant?
1999
1999
Algebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach
The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary… (More)
Is this relevant?
1996
1996
Towards Synchronous and Asynchronous Graph Transformations
Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types of… (More)
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Algebraic Approach to Single-Pushout Graph Transformation
The single-pushout approach to graph transformation interprets a double-pushout transformation rule of the classical algebraic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
1993
1993
Amalgamated Graph Transformations and Their Use for Specifying AGG - an Algebraic Graph Grammar System
ion levels. The formal de nition of this concept which can be found in e.g. [Bey92] regards graphs as a set of objects with three… (More)
Is this relevant?