• No results found

[PDF] Top 20 Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Has 10000 "Volume 10: Graph Transformation and Visual Modeling Techniques 2008" found on our website. Below are the top 20 most common "Volume 10: Graph Transformation and Visual Modeling Techniques 2008".

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... Triple graph transformation [Sch94] has been shown to be a promising approach to consistently co-develop two related ...model transformation can be defined using mod- els consisting of a pair of ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... the transformation is crucial to the success of the development ...the transformation so that these rules can be easily evaluated on the instance ...the transformation is ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... Architectural Design Rewriting (ADR) [BLMT07] is a framework for general reconfigurable software architectures. As in our approach, reconfigurations are modeled using graph transfor- mation rules. Reconfigurations ... See full document

14

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... Formal modeling and analysis of flexible processes in mobile ad-hoc networks [PEH07, For06] we aim to develop a formal technique which on the one hand enables the mod- eling of flexible processes in MANETs and on ... See full document

14

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... to transformation to a common formalim before simulation, this approach, though appealing from a software engineering point of view (it’s object-oriented) discards a lot of useful ... See full document

13

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... special-purpose graph parser for VEX [CHZ95] as an example. VEX is a graph lan- guage for the representation of lambda ...general-purpose graph parsers do not cope well ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... Graph transformation rules can generate infinitely many behavior models. For example, for any data abstraction with potentially infinite states, our specification approach can generate an unbounded number ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... basic graph transformation techniques, an “inheritance” notion on object types, and then use this notion to judge whether an object can be built through inheritance from another ...type graph ... See full document

17

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... input graph whose nodes and edges are labelled with integers, the pro- gram first uses the rule schema pickNode to choose any node and replace its label x with x ... See full document

14

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... the visual representation of the language specific ...the graph model. The reducer then creates the diagram’s instance graph that is analyzed by the model ...provides visual feed- back to the ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... A graph program TTC (Template-Type Checker) looks up dependent names and detects type clashes in expressions for a subset of the C++ template ...message graph, where errors and warnings are embedded. The ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... injective graph morphism p : L → R, where L and R are graphs, called the left- and right-hand ...a graph G and a production p, a rewriting of G using p is realised using a single-pushout graph ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... the transformation sequence in ...This transformation sequence can be summarized to one transformation step via a new concurrent rule with concurrent NACs as depicted in ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... complicated graph transformation system with large (non-local) rules for the sake of avoiding the violation of the triangulation property in the first ...concurrent graph relabeling paradigm ... See full document

16

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... the visual programming paradigm, but are also able to express model-to-model transformations, just to mention two prominent ...to graph transformations have been developed, differing ...store graph ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... Abstract: In this paper we propose a formal extension of type graphs with notions that are commonplace in the UML and have long proven their worth in that context: namely, inheritance, multiplicity, containment and the ... See full document

17

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... In particular, in order to satisfy the the dangling condition, rules are non-deleting (i.e. L ← K is an identity). The gluing condition, if K → R is not an identity, requires border cells of L to be matched to border ... See full document

16

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... the transformation algorithm to constructs such as overlapping chart instances, Kleene star and multiple instance detection with the presence of cold constructs (as discussed ... See full document

15

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... for transformation and manipu- lation is still ...algebraic graph transformations with their wealth of well-known constructions and results for this ...for graph transformation methods, where ... See full document

17

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

Volume 10: Graph Transformation and Visual Modeling Techniques 2008

... a visual representation of designs together with their internal represen- ...a visual language the role of sketches in the conceptual design phase was taken into consideration ... See full document

16

Show all 10000 documents...