Resilience of Well-structured Graph Transformation Systems
Okan \"Ozkan (University of Oldenburg), Nick W\"urdemann (University, of Oldenburg)
TL;DR
This paper investigates the resilience of well-structured graph transformation systems, proving the decidability of key resilience problems within an abstract framework, which aids in understanding recovery in safety-critical systems.
Contribution
It introduces the decidability results for resilience problems in well-structured graph transformation systems, extending the theory with adverse conditions.
Findings
Decidability of two resilience problems established
Framework applicable to systems with adverse conditions
Enhances understanding of recovery in safety-critical systems
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.