32 search results - page 1 / 7 » Concurrent Rewriting for Graphs with Equivalences |
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...
ENTCS
2007
13 years 4 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
FUIN
2007
13 years 4 months ago
2007
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
ACTA
2005
13 years 4 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
WRLA
2010
13 years 3 months ago
2010
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...