Termination Analysis of Model Transformations by Petri Nets
From MaRDI portal
Publication:3541965
DOI10.1007/11841883_19zbMath1156.68501MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Towards a Systematic Method for Proving Termination of Graph Transformation Systems, Combining termination proofs in model transformation systems, A framework for model transformation verification, Automating the transformation-based analysis of visual languages, Grammar-based model transformations: definition, execution, and quality properties, Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings, Workshop on Petri Nets and Graph Transformations
Uses Software