Resilience of well-structured graph transformation systems

DOI10.4204/EPTCS.350.5MaRDI QIDQ6649537zbMATH OpenFDO

Authors Okan Özkan, Nick Würdemann

Publication date 6 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.350.5

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

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

Cites work

• Correctness of high-level transformation systems relative to nested conditions
• Fundamentals of algebraic graph transformation
• Graph minors. XX: Wagner's conjecture
• Graph Transformation with Dependencies for the Specification of Interactive Systems
• Graph Transformations
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 7456049 (Why is no real title available?)
• Subgraphs and well‐quasi‐ordering
• The residue of vector sets with applications to decidability problems in Petri nets
• Well-structured graph transformation systems
• Well-structured transition systems everywhere!

This page was built for publication: Resilience of well-structured graph transformation systems

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