In computer science, single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used inâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested applicationâ€¦Â (More)

Is this relevant?

2012

2012

- Vincent Danos, JÃ©rÃ´me Feret, +5 authors Glynn Winskel
- 2012

The Kappa calculus defines how a graph, repre-<lb>senting a system of linked agents, can be modified by rules<lb>that specifyâ€¦Â (More)

Is this relevant?

2010

2010

- Leila Ribeiro, Fernando LuÃs Dotti, Simone AndrÃ© da Costa Cavalheiro, Fabiane Cristine Dillenburg
- ECEASST
- 2010

Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states areâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGenâ€¦Â (More)

Is this relevant?

2005

2005

- Paolo Baldan, Andrea Corradini, Ugo Montanari
- Electr. Notes Theor. Comput. Sci.
- 2005

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)

Is this relevant?

2004

2004

- Ricardo Alberich, MercÃ¨ LlabrÃ©s, Francesc RossellÃ³
- Int. J. Found. Comput. Sci.
- 2004

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

- Peter Burmeister, Miquel Monserrat, Francesc RossellÃ³, Gabriel Valiente
- Theor. Comput. Sci.
- 1999

The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unaryâ€¦Â (More)

Is this relevant?

1996

1996

- Gabriele Taentzer
- Fundam. Inform.
- 1996

Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types ofâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Michael LÃ¶we
- Theor. Comput. Sci.
- 1993

The single-pushout approach to graph transformation interprets a double-pushout transformation rule of the classical algebraicâ€¦Â (More)

Is this relevant?

1993

1993

- Gabriele Taentzer, Martin K Beyer
- Dagstuhl Seminar on Graph Transformations inâ€¦
- 1993

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?