• Aucun résultat trouvé

A Persistent Naming System Based on Graph Transformation Rules

N/A
N/A
Protected

Academic year: 2021

Partager "A Persistent Naming System Based on Graph Transformation Rules"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-01816907

https://hal.archives-ouvertes.fr/hal-01816907

Submitted on 25 Jun 2018

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

A Persistent Naming System Based on Graph Transformation Rules

David Marcheix, Xavier Skapin, Anaïs Cardot, Nadine Dieudonné-Glad

To cite this version:

David Marcheix, Xavier Skapin, Anaïs Cardot, Nadine Dieudonné-Glad. A Persistent Naming System Based on Graph Transformation Rules . WSCG, 2018, Plzen, Czech Republic. Computer Science Research Notes, 27 (1-2), pp.48-54, 2018, Journal of WSCG. �hal-01816907�

(2)

A Persistent Naming System Based on Graph Transformation Rules

Additional logos (optional)

Marcheix D., Cardot A., Skapin X., Dieudonné-Glad N.

Contact email : anais,cardot@univ-poitiers,fr

Keywords: Persistent Naming, Reevaluation, G-Maps, Jerboa, Transformation Rules

Objective

Bulletin Board

Reevaluation

• Solve the persistent naming problem

• Match the entities

• Made thanks to the History records,

• Completed when an operation is

deleted or added

Generalized Map

• Topological Model

• Based on boundaries

Persistant Naming and History Record

• Homogenous and general

• Updated with every new operations

• PNa=1-n7 and PNb= 1-n4 after Step 1, 1-n7;2n0 and 1-n4;2n1 after Step 2

c is created from a at Step 2, and PNc = 1-n7;2-n2

Jerboa Rules

• Rewrites a

GMap

Références

Documents relatifs

Based on specifications given by the Object Management Group (OMG), we have established transformation rules in ATLAS Transformation Language (ATL) to obtain a model consistent with

Given a rewriting rule with a left-hand side L and a right-hand side R and a matching m of L in a graph G, the transformation of the nodes and the matching edges of G is provided by

As the purpose of this work is to introduce the transformation framework and the way it could be used within safety rules validation processes, the next sections will detail, on the

The first stage es- sentially addresses the local syntactic phenomena through local tree transformation rules whose ac- tion is to add a set of edges to the target graph be- ing

Such an inference queue loaded with data transformation rules at service composition time, and loaded with upstream data at runtime, will be able to convert that data to the

The formal models that allow the generation of a graph grammar for dynamic architecture description and the automatic definition of transformation rules for achieving

The main objective of this work was to automate the horizontal and vertical transformation rules proposed by the activities 1) Prepare Requirements Models and 2)

The shared concepts are then transformed from the source to the target model using transformation rules (mapping rules).. In the source model, the specific part can thus be