Termination Criteria for DPO Transformations with Injective Matches

DOI10.1016/J.ENTCS.2007.04.019zbMath1278.68123OpenAlexW2001704173WikidataQ114182438 ScholiaQ114182438MaRDI QIDQ2867892

Ulrike Prange, Tihamer Levendovszky, Hartmut Ehrig

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.04.019

zbMATH Keywords

model transformationgraph transformationtermination criteriaDPO approach

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (3)

Explicit State Model Checking for Graph Grammars ⋮ Unnamed Item ⋮ Towards a Systematic Method for Proving Termination of Graph Transformation Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of algebraic graph transformation
• Fundamental Approaches to Software Engineering
• Diagrammatic Representation and Inference

This page was built for publication: Termination Criteria for DPO Transformations with Injective Matches