We define an algebraic structure for the set of finite graphs, a notion of graph expression for defining them, and a complete set of equational rules for manipulating graph expressions. (By agraph weâ€¦ (More)

In this paper, we report on our experiment with the deployment of a virtual machine, Netquest, which evaluates protocols written in a declarative language, over iMote devices. Netquest offers a newâ€¦ (More)

The very extensive literature on rewriting-be it words, terms, graphs or whatever-, basically relies on the deenition of a notion of substitution which can be intuitively understood as the successionâ€¦ (More)

Rewriting usually relies on a notion of substitution which can be understood as the succession of three basic operations: deletion of the part to be rewritten to provide a context, union of thisâ€¦ (More)

Most of the works in the theory of graph rewriting can be put into two main categories : edge (or hyperedge) rewriting and node rewriting. Each has been described by a speciic formalism, both haveâ€¦ (More)

To define NLC grammars for vertex replacement, we provide a categorical framework based on pullbacks in the category of graphs, whose major feature is probably that the connection relation isâ€¦ (More)