A uniform approach to graph rewriting: The pullback approach

Abstract

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 specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison much clearer.