Resilience of Well-structured Graph Transformation Systems

07/29/2021
by   Okan Özkan, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset