What sufficient conditions make confluence of general (hyper-)graph rewriting decidable?

The source page states the original problem together with its recorded qualifications and progress updates as follows.

In contrast to term rewriting, confluence of general (hyper-)graph rewriting---in the ``Berlin approach''---is undecidable, even for terminating systems [Plump, 1993]. What sufficient conditions make confluence decidable?