Termination Analysis of Model Transformations by Petri Nets

DOI10.1007/11841883_19zbMath1156.68501OpenAlexW1521011607MaRDI QIDQ3541965

Szilvia Varró-Gyapay, Dániel Varró, Ulrike Prange, Hartmut Ehrig, Gabriele Taentzer

Publication date: 27 November 2008

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

Full work available at URL: https://doi.org/10.1007/11841883_19

zbMATH Keywords

Petri netsterminationmodel transformationgraph transformation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings ⋮ A framework for model transformation verification ⋮ Unnamed Item ⋮ Workshop on Petri Nets and Graph Transformations ⋮ Towards a Systematic Method for Proving Termination of Graph Transformation Systems ⋮ Grammar-based model transformations: definition, execution, and quality properties ⋮ Combining termination proofs in model transformation systems ⋮ Automating the transformation-based analysis of visual languages

Uses Software

• GAMS
• AToM3

This page was built for publication: Termination Analysis of Model Transformations by Petri Nets