Decidability of Resilience for Well-Structured Graph Transformation Systems

DOI10.1007/978-3-031-09843-7_3MaRDI QIDQ6487305zbMATH OpenFDO

Authors Okan Özkan

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09843-7_3

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Well-structured graph transformation systems
• A general framework for well-structured graph transformation systems
• Well-structured graph transformation systems with negative application conditions
• Development of Correct Graph Transformation Systems

Cites work

• Correctness of high-level transformation systems relative to nested conditions
• Fundamentals of algebraic graph transformation
• Graph Transformations
• Hoare-style verification of graph programs
• scientific article; zbMATH DE number 50008 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 559221 (Why is no real title available?)
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Subgraphs and well‐quasi‐ordering
• Well-structured graph transformation systems
• Well-structured transition systems everywhere!

Cited in

(4)

• A conceptual framework for resilience: fundamental definitions, strategies and metrics
• Self-similarity breeds resilience
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Resilience of well-structured graph transformation systems

This page was built for publication: Decidability of Resilience for Well-Structured Graph Transformation Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487305)