  The framework of global transformations aims at describing synchronous
rewriting systems on a given data structure. In this work we focus on the data
structure of graphs. Global transformations of graphs are defined and a local
criterion is given for a rule system to extend to a graph global
transformation. Finally we present an algorithm, with its correction, which
computes online the global transformation of a finite graph in an accretive
manner.
