Resilience of Well-structured Graph Transformation Systems

Okan Özkan
(University of Oldenburg)
Nick Würdemann
(University of Oldenburg)

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.

In Berthold Hoffmann and Mark Minas: Proceedings Twelfth International Workshop on Graph Computational Models (GCM 2021), Online, 22nd June 2021, Electronic Proceedings in Theoretical Computer Science 350, pp. 69–88.
Published: 21st December 2021.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: