Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457): Difference between revisions

@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Q4435867
@@ Property / cites work: Q4435867 / rank @@
+Normal rank
@@ Property / cites work @@
+A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
+Normal rank
@@ Property / cites work @@
+Fundamental Approaches to Software Engineering
@@ Property / cites work: Fundamental Approaches to Software Engineering / rank @@
+Normal rank
@@ Property / cites work @@
+Match-bounded string rewriting systems
@@ Property / cites work: Match-bounded string rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Termination Criteria for DPO Transformations with Injective Matches
+Normal rank
@@ Property / cites work @@
+Q2712584
@@ Property / cites work: Q2712584 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite family developments
@@ Property / cites work: Finite family developments / rank @@
+Normal rank
@@ Property / cites work @@
+Essentials of Term Graph Rewriting
@@ Property / cites work: Essentials of Term Graph Rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q3837998
@@ Property / cites work: Q3837998 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Grammars and Computing by Graph Transformation
+Normal rank
@@ Property / cites work @@
+Termination Analysis of Model Transformations by Petri Nets
+Normal rank