Resilience of Well-structured Graph Transformation Systems
Software Engineering
2021-12-22 v4 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.2108.00889,
title = {Resilience of Well-structured Graph Transformation Systems},
author = {Okan Özkan and Nick Würdemann},
journal= {arXiv preprint arXiv:2108.00889},
year = {2021}
}
Comments
In Proceedings GCM 2021, arXiv:2112.10217