Termination analysis for graph transformation systems
From MaRDI portal
Recommendations
- Towards a systematic method for proving termination of graph transformation systems
- Proving termination of graph transformation systems using weighted type graphs over semirings
- Modular termination of graph transformation
- scientific article; zbMATH DE number 1183250
- Combining termination criteria by isolating deletion
Cited in
(20)- Modular termination of graph transformation
- Proving termination of graph transformation systems using weighted type graphs over semirings
- Reachability in graph transformation systems and slice languages
- Termination of cycle rewriting by transformation and matrix interpretation
- Termination graphs for Java bytecode
- Non-simplifying graph rewriting termination
- Certifying a Termination Criterion Based on Graphs, without Graphs
- scientific article; zbMATH DE number 1183250 (Why is no real title available?)
- scientific article; zbMATH DE number 1863175 (Why is no real title available?)
- Combining termination criteria by isolating deletion
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Kruskal's tree theorem for acyclic term graphs
- Patch graph rewriting
- A flexible and easy-to-use library for the rapid development of graph tools in Java
- Towards a systematic method for proving termination of graph transformation systems
- Grez
- On termination of graph rewriting
- Termination of graph transformation systems using weighted subgraph counting
- Termination of graph transformation systems via generalized weighted type graphs
- Termination of graph transformation systems using weighted subgraph counting
This page was built for publication: Termination analysis for graph transformation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190160)
