Termination of graph transformation systems using weighted subgraph counting
From MaRDI portal
Cites work
- Abstract and concrete categories: the joy of cats
- Adhesive and quasiadhesive categories
- Algebraic approach to single-pushout graph transformation
- Algebraic graph rewriting with controlled embedding
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Computational category-theoretic rewriting
- Double-pushout graph transformation revisited
- Drags: a compositional algebraic framework for graph rewriting
- Foundations of Software Science and Computation Structures
- From linear term rewriting to graph rewriting with preservation of termination
- Fundamentals of algebraic graph transformation
- Fundamentals of compositional rewriting theory
- Fuzzy presheaves are quasitoposes
- Graph path orderings
- Graph rewriting and relabeling with PBPO^+: a unifying theory for quasitoposes
- Graph Transformation by Computational Category Theory
- Handbook of Graph Grammars and Computing by Graph Transformation
- Hereditary pushouts reconsidered
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- 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 193170 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 1361503 (Why is no real title available?)
- scientific article; zbMATH DE number 1840601 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 822489 (Why is no real title available?)
- Kruskal's tree theorem for acyclic term graphs
- Matrix Interpretations for Proving Termination of Term Rewriting
- Modular termination of graph transformation
- On termination of graph rewriting
- On the axioms for adhesive and quasiadhesive categories
- Orderings for term-rewriting systems
- 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
- Termination of graph transformation systems using weighted subgraph counting
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination of String Rewriting with Matrix Interpretations
- Termination of term rewriting using dependency pairs
- The PBPO graph transformation approach
- Toposes Are Adhesive
- Tuple interpretations for termination of term rewriting
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 Q7034617)
