Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph transformation systems. Our main contribution is the decidability of two resilience problems for well-structured graph transformation systems (with strong compatibility). We prove our results in the abstract framework of well-structured transition systems and apply them to graph transformation systems, incorporating also the concept of adverse conditions.

翻译：复原力的概念是对计算机科学和软件工程越来越感兴趣。对于安全条件无法实现的系统,需要快速恢复。我们调查图形转换系统的恢复能力问题。我们的主要贡献是结构完善的图形转换系统(具有很强的兼容性)的两种恢复能力问题。我们在结构完善的过渡系统的抽象框架中证明了我们的成果,并将其应用于图形转换系统,同时纳入不利条件的概念。