نتایج جستجو برای: graph transformation system

تعداد نتایج: 2554783  

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Leen Lambers

GTXL (Graph Transformation Exchange Language) is designed to support and stimulate developers to provide their graph transformation-based tools with an exchange functionality regarding the integration with other tools. For this exchange XML was chosen as underlying technology. The exchange of graphs is facilitated by the exchange format GXL which is also XML-based. GTXL uses GXL to describe the...

2003
Gabriele Taentzer

AGG is a general development environment for algebraic graph transformation systems which follows the interpretative approach. Its special power comes from a very flexible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environ...

2002
Dániel Varró

Model transformation systems are graph transformation systems that perform translations between languages defined by a corresponding metamodel as the type graph. The current paper proposes a reflective method for the automatic generation of the implementation for such transformation systems derived from a high–level specification consisting of a set of graph transformation rules and a control f...

2001
Paolo Baldan Andrea Corradini Barbara König

In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of the graph transformation system. The fact that any rea...

Journal: :J. Vis. Lang. Comput. 2006
Karsten Hölscher Paul Ziemann Martin Gogolla

In this paper we present a concept of a rigorous approach that provides a formal semantics for a fundamental subset of UML. This semantics is derived by translating a given UML model into a graph transformation system, allowing modelers to actually execute their UML model. The graph transformation system comprises graph transformation rules and a working graph which represents the current state...

Journal: :Electr. Notes Theor. Comput. Sci. 2008
Arend Rensink Ronald Nederpel

It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to one of the original QVT language proposals; that is, we define a mechanism that will translate an...

2012
Somayeh Azizi Vahid Panahi

Graphs and diagrams provide a simple and powerful approach variety of problems that are typical to computer science, for example for activities. In software development visual notation are used for modeling that including activity diagram, class diagram, control flow, graphs and some another diagrams. Models based on these notation can be seen a graph and graph transformation are involved. So A...

Journal: :communication in combinatorics and optimization 0
mehdi eliasi dept. of mathematics, khansar faculty of mathematics and computer science, khansar, iran, ali ghalavand dept. of mathematics, khansar faculty of mathematics and computer science, khansar, iran

for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...

2013
Fernando Orejas Artur Boronat Ulrike Golas Nikos Mylonakis

Borrowed context graph transformation is a technique developed by Ehrig and Koenig to define bisimilarity congruences from reduction semantics defined by graph transformation. This means that, for instance, this technique can be used for defining bisimilarity congruences for process calculi whose operational semantics can be defined by graph transformation. Moreover, given a set of graph transf...

Journal: :ECEASST 2012
Christine Natschläger Klaus-Dieter Schewe

The algebraic graph transformation approach was initiated in 1973 and supports the rule-based modification of graphs based on pushout constructions. The vertex and edge types used within the rules (or productions) as well as possible inheritance relationships defined between them are specified in the type graph. However, the termination proof can only be accomplished for graph transformation sy...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید