A Collection Operator for Graph Transformation

2009 ◽  
pp. 67-82 ◽  
Author(s):  
Roy Grønmo ◽  
Stein Krogdahl ◽  
Birger Møller-Pedersen
Keyword(s):  
Graph Transformation

scholarly journals A modular graph transformation rule set for IFC‐to‐CityGML conversion

2021 ◽  
Vol 25 (1) ◽  
pp. 261-290
Author(s):  
Helga Tauscher ◽  
Joie Lim ◽  
Rudi Stouffs
Keyword(s):  
Graph Transformation ◽  
Transformation Rule ◽  
Rule Set ◽  
Graph Transformation Rule

scholarly journals Image-Guided Human Reconstruction via Multi-Scale Graph Transformation Networks

2021 ◽  
pp. 1-1
Author(s):  
Kun Li ◽  
Hao Wen ◽  
Qiao Feng ◽  
Yuxiang Zhang ◽  
Xiongzheng Lia ◽  
...  
Keyword(s):  
Graph Transformation ◽  
Multi Scale ◽  
Image Guided

scholarly journals Graph traversal and graph transformation

2004 ◽  
Vol 321 (2-3) ◽  
pp. 215-231
Author(s):  
Jason J Holdsworth
Keyword(s):  
Graph Transformation ◽  
Graph Traversal

Deep graph transformation for attributed, directed, and signed networks

2021 ◽  
Author(s):  
Xiaojie Guo ◽  
Liang Zhao ◽  
Houman Homayoun ◽  
Sai Manoj Pudukotai Dinakarrao
Keyword(s):  
Graph Transformation ◽  
Signed Networks

A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS

2009 ◽  
Vol 19 (06) ◽  
pp. 857-870 ◽  
Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI
Keyword(s):  
Graph Transformation ◽  
Behavioral Modeling ◽  
Model Transformations ◽  
Software Systems ◽  
Hierarchical Systems ◽  
Input Language ◽  
Novel Approach ◽  
Graph Schema ◽  
Transformation Systems ◽  
Graph Transformation Systems

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems. The AGG-like graph transformation systems are translated to BIR — the input language of Bogor — and Bogor verifies that model against some properties defined by combining LTL and special purpose graph rules. Supporting schema-based and layered graphs characterize our approach among existing solutions for verification of graph transformation systems.

Sign in / Sign up

Export Citation Format

Share Document