Bisimilarity in term graphs rewriting (2007)
Z. M. Ariola, J. W. Klop, D. Plump, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Hierarchical graph transformation (2002)
Drewes, F., Hoffmann, B., Plump, D.
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of...
Double-pushout graph transformation revisited (2001)
Habel, A., Muller, J., Plump, D.
In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand...
Computational Completeness of Programming Languages Based on Graph Transformation (2001)
We identify a set of programming constructs ensuring that a programming language based on graph transformation is computationally complete. These constructs are (1) nondeterministic application of a...
Reduction Systems . . . . . . . . . . 5 1.3 Term Graphs . . . . . . . . . . . . . . . . . . . . 9 1.4 Term Graph Rewriting . . . . . . . . . . . . . . 15 1.5 Completeness . . . . . . . . . . . . . ....
Bisimilarity in Term Graph Rewriting (1998)
Zena M. Ariola, Jan Willem Klop, D. Plump
We present a survey of confluence properties of (acyclic) term graph rewriting. Results and counterexamples are given for different kinds of term graph rewriting: besides plain applications of...
ABSTRACT Bisimilarity in Term Graph Rewriting (1998)
Z. M. Ariola, J. W. Klop, D. Plump, Issn -x, Copyright Stichting, Mathematisch Centrum, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of