[PDF] Top 20 Volume 41: Graph Transformation and Visual Modeling Techniques 2011

... Using the DG, we can devise different coverage criteria such as cr, cd, ud, etc. The ques- tion is, which of these pairs to include into our criteria. If we demand all cr (create-read), cu (create-update), cd ... See full document

... Abstract: Dynamic reconfigurations are a powerful approach for the adaption of component-based or service-oriented software systems at runtime. Important issues in this area are the problems of state transfer and state ... See full document

... Finally, let us remark that we did not treat the question of how to obtain such path or tree decompositions, given a single, monolithic graph. This is a non-trivial problem that has been studied by Bodlaender et ... See full document

... Spider Diagrams (SDs) are a diagrammatic logical specification and reasoning system built on top of Euler Diagrams (EDs), suitable for expressing monadic first order logic with equality statements [STHT04]. Constraint ... See full document

... underly graph transformation, following the seminal work of ...a graph rewriting system consists of a set of graph rewrite rules with a left-hand side L and a right-hand side R (where both are ... See full document

... In this work, we follow this second approach, focusing on a novel encoding 1 , in Maude, of state-of-the-art techniques for defining and managing design inconsistencies so that they can be applied in MOF ... See full document

... Standard Kripke models identify elements through different worlds (trans-world identity), with implicitly defined identity morphisms, having as result a unique domain for the elements of the worlds. The presence of the ... See full document

... the graph language classes accepted by both kinds of automaton functor are closed under the boolean operations and that the word problem of both kinds is ... See full document

... provide techniques for the verification and validation of model transformations [9, 1, 3] in order to detect underspecified parts or mismatches to the requirements of the ... See full document

... and visual elements has connections to other related ...and graph transfor- ...purpose visual model query language is introduced. [EB10] discusses the graph query language GReQL especially ... See full document

... type graph in Figure 2, presented as a UML class diagram, where stereotypes have been used to distinguish between types of box and types of ...type graph depicted in Figure 2 is the outcome of a complex ... See full document

... In order to detect violations of security, one can modify the GAC for rule r a 3 to check that all contents are served. For the cases (a1) and (a3) the failure of this rule would signal the violation. Figure 16 presents ... See full document

... connected to other diagram components. In class diagrams, a class, for instance, has its border as attachment area, and an association has its start point and its end point as attachment areas. Con- nections can be ... See full document

... During play-out, symbolic MSDs and binding expressions are interpreted as follows: As a message event can be (parameter) unified with a first message in an MSD, an active MSD is created [r] ... See full document

... Compensation concerns often crosscut other programming concerns and thus attempting to pro- gram compensations within the main flow of a program would clutter the program and also limit the expressivity of compensation ... See full document

... There exist some diagram editors that are somewhat related to our approach. The most rele- vant examples are G LIDE [RMS97] and D UNNART [DMW09, DMS + 08], two editors for graph- based visual languages. ... See full document

... of graph transformation rules pays off only for complex model transformation tasks ...behavioral modeling are sufficiently expressive and more concise than graph transformation ... See full document

... Besides, observe that there is redundancy between transfer-1 and transfer-2 of both splits. This redundancy originates from the fact that both splits have a node in common, which is one of the machines. This redundancy ... See full document

... The goal of DeonticBpmnGTS is to transform BPMN diagrams to Deontic BPMN diagrams thereby replacing all BpmnTasks with DeonticTasks. For this purpose, DeonticBpmnGTS defines 18 productions with 27 application conditions ... See full document

... host graph is expected to have a path between the image of the rule edge’s source to the image of the rule edge’s target, such that the path labels, when concatenated, form a word in the language of the regular ... See full document