Termination of graph transformation systems using weighted subgraph counting
From MaRDI portal
Publication:6535508
DOI10.1007/978-3-031-36709-0_5zbMATH Open1545.68063MaRDI QIDQ6535508FDOQ6535508
Authors: Roy Overbeek, Jörg Endrullis 
Publication date: 12 January 2024
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Sesqui-Pushout Rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of algebraic graph transformation
- Adhesive and quasiadhesive categories
- Title not available (Why is that?)
- Double-pushout graph transformation revisited
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Title not available (Why is that?)
- Concurrency theorems for non-linear rewriting theories
- Modular termination of graph transformation
- The PBPO graph transformation approach
- Graph path orderings
- Algebraic graph rewriting with controlled embedding
- Title not available (Why is that?)
- Termination of cycle rewriting
- Proving termination of graph transformation systems using weighted type graphs over semirings
- Termination analysis for graph transformation systems
- On termination of graph rewriting
- Termination of cycle rewriting by transformation and matrix interpretation
- Title not available (Why is that?)
- Kruskal's tree theorem for acyclic term graphs
- Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes
- Fuzzy presheaves are quasitoposes
- From linear term rewriting to graph rewriting with preservation of termination
Cited In (1)
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)
