Resilience of Well-structured Graph Transformation Systems
This work addresses resilience issues in software engineering and computer science, focusing on graph transformation systems, but it appears incremental as it extends existing frameworks to incorporate adverse conditions.
The paper tackles the problem of ensuring fast recovery for graph transformation systems when safety conditions cannot be met, proving the decidability of two resilience problems for well-structured graph transformation systems with strong compatibility.
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.