71 search results - page 1 / 15 » Bisimilarity in Term Graph Rewriting |
IANDC
2000
13 years 5 months ago
2000
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...
RTA
1991
Springer
13 years 9 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
ENTCS
2008
13 years 5 months ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...