Similar Items: Termination of Graph Transformation Systems Using Weighted Subgraph Counting
- Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
- On the First-Order Complexity of Induced Subgraph Isomorphism
- Well-definedness of Streams by Transformation and Termination
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation
- A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems
- Using weakest application conditions to rank graph transformations for graph repair