Termination of graph transformation systems using weighted subgraph counting

DOI10.1007/978-3-031-36709-0_5MaRDI QIDQ6535508zbMATH OpenFDO

Authors Roy Overbeek, Jörg Endrullis

Publication date 12 January 2024

zbMATH Keywords

pullbackpushoutterminationgraph transformation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Topoi (18B25)

Recommendations

• Termination analysis for graph transformation systems
• Proving termination of graph transformation systems using weighted type graphs over semirings
• Towards a systematic method for proving termination of graph transformation systems
• The PBPO graph transformation approach

Cites work

• scientific article; zbMATH DE number 4047065 (Why is no real title available?)
• scientific article; zbMATH DE number 4090779 (Why is no real title available?)
• scientific article; zbMATH DE number 1183250 (Why is no real title available?)
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 47619 (Why is no real title available?)
• scientific article; zbMATH DE number 107664 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 1361503 (Why is no real title available?)
• scientific article; zbMATH DE number 1380891 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• scientific article; zbMATH DE number 822489 (Why is no real title available?)
• Adhesive and quasiadhesive categories
• Algebraic graph rewriting with controlled embedding
• Concurrency theorems for non-linear rewriting theories
• Double-pushout graph transformation revisited
• Foundations of Software Science and Computation Structures
• From linear term rewriting to graph rewriting with preservation of termination
• Fundamentals of algebraic graph transformation
• Fuzzy presheaves are quasitoposes
• Graph path orderings
• Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes
• Kruskal's tree theorem for acyclic term graphs
• Modular termination of graph transformation
• On termination of graph rewriting
• Proving termination of graph transformation systems using weighted type graphs over semirings
• Quasitoposes, Quasiadhesive Categories and Artin Glueing
• Sesqui-Pushout Rewriting
• Termination analysis for graph transformation systems
• Termination of cycle rewriting
• Termination of cycle rewriting by transformation and matrix interpretation
• The PBPO graph transformation approach

Cited in

(1)

• Fuzzy presheaves are quasitoposes

This page was built for publication: Termination of graph transformation systems using weighted subgraph counting

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