Critical pair analysis in single-pushout graph rewriting

In this paper we prove as a central theorem, that the local confluence of critical pairs implies the local confluence of a single-pushout graph rewriting system. For this result it is necessary to suitable generalize the notions of critical pair and confluence from the standard case of term or tree rewriting to the more gneral case of graph transformation