Termination of graph transformation systems using weighted subgraph counting
From MaRDI portal
Publication:6535508
DOI10.1007/978-3-031-36709-0_5zbMATH Open1545.68063MaRDI QIDQ6535508
Publication date: 12 January 2024
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?)
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular termination of graph transformation
- The PBPO graph transformation approach
- Algebraic graph rewriting with controlled embedding
- Concurrency theorems for non-linear rewriting theories
- Fundamentals of algebraic graph transformation
- Double-pushout graph transformation revisited
- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation
- Termination Analysis for Graph Transformation Systems
- Sesqui-Pushout Rewriting
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Termination of Cycle Rewriting
- Graph Path Orderings
- Foundations of Software Science and Computation Structures
- Adhesive and quasiadhesive categories
- On termination of graph rewriting
- 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
Related Items (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)
