17 search results - page 1 / 4 » Parallel Admissible Graph Rewriting |
WADT
1998
Springer
13 years 9 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
PDP
1996
IEEE
13 years 9 months ago
1996
IEEE
GG
2008
Springer
13 years 5 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...