作者: critic 時間: 2025-3-21 23:38 作者: Organization 時間: 2025-3-22 00:58 作者: 歪曲道理 時間: 2025-3-22 07:16
Improving Flow in Software Development Through Graphical Representations in software engineering. Many of the popular tools used in industry offer simple, yet highly effective, graphical aids to enhance programming tasks. In particular, tree views are frequently used to present features in the software and to facilitate navigation. General graph layouts, popular in many作者: 打擊 時間: 2025-3-22 12:09 作者: fixed-joint 時間: 2025-3-22 14:09 作者: fixed-joint 時間: 2025-3-22 20:03
Rule Execution in Graph-Based Incremental Interactive Integration Tools documents are created which have to be kept consistent with each other. Graph transformations are well suited for modeling the operations provided for maintaining inter-document consistency. In this paper, we describe a novel approach to rule execution for graph-based integration tools operating in作者: Exploit 時間: 2025-3-23 00:24 作者: 喧鬧 時間: 2025-3-23 02:22
Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformationin these grammars may be triggered by user actions (such as creating, editing or connecting elements) and in its turn may trigger other user-interface events. Its combination with (non-monotonic) triple graph grammars allows constructing and checking the consistency of the abstract syntax graph whil作者: monochromatic 時間: 2025-3-23 08:21 作者: chandel 時間: 2025-3-23 11:48 作者: 遺棄 時間: 2025-3-23 17:18
Concepts for Specifying Complex Graph Transformation Systemsns having more than one hundred pages they suffer from the same problems as large applications written in programming languages like C++ or Java do. Under the term programming in the large many different concepts have been developed to aid the solution of these problems. However, most graph transfor作者: Genetics 時間: 2025-3-23 19:13 作者: squander 時間: 2025-3-23 23:37 作者: Injunction 時間: 2025-3-24 05:13 作者: mendacity 時間: 2025-3-24 08:14
Fundamental Theory for Typed Attributed Graph Transformationbut up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresponding category is isomorphic to the category of alge作者: 樹上結(jié)蜜糖 時間: 2025-3-24 14:15 作者: 施加 時間: 2025-3-24 17:28
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systemser, at present, code generators are not as mature as classical compilers and they need to be extensively tested. This paper proposes a technique for systematically deriving suitable test cases for code generators, involving the interaction of chosen sets of rules. This is done by formalising the beh作者: consolidate 時間: 2025-3-24 21:33
Stochastic Graph Transformation Systemsted environments, where due to the high volatility of network connections reasoning on such properties is most important, is best described by graph transformation systems..Consequently, in this paper we introduce stochastic graph transformation systems, following the outline of stochastic Petri net作者: 平常 時間: 2025-3-24 23:52 作者: 謊言 時間: 2025-3-25 04:04
Embedding in Switching Classes with Skew Gainstions of (group-labelled) graphs through local transformations of the vertices..Various relatively efficient algorithms exist for deciding whether a graph can be switched so that it contains some other graph, the query graph, as an induced subgraph in case vertices are given an identity. However, wh作者: 男生如果明白 時間: 2025-3-25 07:46
https://doi.org/10.1007/978-1-4614-1854-2 in software engineering. Many of the popular tools used in industry offer simple, yet highly effective, graphical aids to enhance programming tasks. In particular, tree views are frequently used to present features in the software and to facilitate navigation. General graph layouts, popular in many作者: 否認(rèn) 時間: 2025-3-25 15:02
https://doi.org/10.1007/978-3-322-90695-3ization. Research on applying graph theory to access control problems goes back almost three decades. Nevertheless it is yet to make its way into the mainstream of access control research and practice. Much of this prior research is based on first principles, although more recently there have been s作者: calamity 時間: 2025-3-25 16:50 作者: 以煙熏消毒 時間: 2025-3-25 23:26 作者: Encapsulate 時間: 2025-3-26 00:27 作者: MUMP 時間: 2025-3-26 05:08 作者: excursion 時間: 2025-3-26 10:48 作者: Spirometry 時間: 2025-3-26 15:18 作者: 無辜 時間: 2025-3-26 18:58 作者: restrain 時間: 2025-3-26 22:43
Ben Fincham,Mark McGuinness,Lesley Murraying of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and a high degree of parallelism this paper introduces ty作者: dermatomyositis 時間: 2025-3-27 01:51 作者: CONE 時間: 2025-3-27 07:23 作者: 依法逮捕 時間: 2025-3-27 11:42
https://doi.org/10.1007/978-3-322-86790-2but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresponding category is isomorphic to the category of alge作者: 文字 時間: 2025-3-27 17:34 作者: 憤世嫉俗者 時間: 2025-3-27 21:51
https://doi.org/10.1007/978-3-8348-2204-8er, at present, code generators are not as mature as classical compilers and they need to be extensively tested. This paper proposes a technique for systematically deriving suitable test cases for code generators, involving the interaction of chosen sets of rules. This is done by formalising the beh作者: 嘲笑 時間: 2025-3-28 00:55 作者: HEAVY 時間: 2025-3-28 06:03
Mobile Phone Security and Forensicsxtend the benefits of model checking to systems whose behavior is specified by graph transformation systems. One approach is to encode the graphs into the fixed state vectors and the transformation rules into guarded commands that modify these state vectors appropriately to enjoy all the benefits of作者: 鍍金 時間: 2025-3-28 07:28
https://doi.org/10.1007/978-3-476-04854-7tions of (group-labelled) graphs through local transformations of the vertices..Various relatively efficient algorithms exist for deciding whether a graph can be switched so that it contains some other graph, the query graph, as an induced subgraph in case vertices are given an identity. However, wh作者: 工作 時間: 2025-3-28 11:13
Transformation Language Design: A Metamodelling Foundationof the generic nature of MOF, it is also being used as the means of expressing the QVT language itself..When the QVT process began (over two years ago), the task initially seemed quite straightforward. After all, many different transformation languages were already described in the literature, and i作者: 艱苦地移動 時間: 2025-3-28 14:45
Composition of Relations in Enterprise Architecture Modelslity, by allowing to leave out certain details, and automated abstraction and complexity reduction of models facilitating stakeholder-specific visualisations. For a specific enterprise architecture modelling language, we explicitly derive this composition operator. Because of the specific properties作者: 污穢 時間: 2025-3-28 22:23
Analysis of Metabolic Pathways by Graph Transformationction of transforming a substrate chemical graph to a product chemical graph using a set of explicit chemical reactions, is stated as the problem of finding an appropriate set of sequences of chemical graph transformations from the substrate to the product, and the design of a graph transformation s作者: Ethics 時間: 2025-3-28 23:13
Fundamental Theory for Typed Attributed Graph Transformationoach to typed attributed graph transformation providing as fundamental results the Local Church-Rosser, Parallelism, Concurrency, Embedding and Extension Theorem and a Local Confluence Theorem known as Critical Pair Lemma in the literature.作者: 支架 時間: 2025-3-29 06:49
Model Checking Graph Transformations: A Comparison of Two Approachesh of them, and we evaluate the results. Our conclusion is that the first approach outperforms the second if the dynamic and/or symmetric nature of the problem under analysis is limited, while the second shows its superiority for inherently dynamic and symmetric problems.作者: refraction 時間: 2025-3-29 07:35 作者: 動作謎 時間: 2025-3-29 11:39 作者: 是剝皮 時間: 2025-3-29 17:42
https://doi.org/10.1007/978-3-030-25316-5ction of transforming a substrate chemical graph to a product chemical graph using a set of explicit chemical reactions, is stated as the problem of finding an appropriate set of sequences of chemical graph transformations from the substrate to the product, and the design of a graph transformation s作者: 微粒 時間: 2025-3-29 20:05
https://doi.org/10.1007/978-3-322-86790-2oach to typed attributed graph transformation providing as fundamental results the Local Church-Rosser, Parallelism, Concurrency, Embedding and Extension Theorem and a Local Confluence Theorem known as Critical Pair Lemma in the literature.作者: 充足 時間: 2025-3-30 00:09 作者: 增強(qiáng) 時間: 2025-3-30 04:53
https://doi.org/10.1007/978-3-658-03251-7eover, the more general structure of hierarchical graphs and of transformation rules leads to a refined condition, termed fragmented parallel independence, which subsumes both parallel independence and non-critical overlap as special cases.作者: Apogee 時間: 2025-3-30 10:29
Parallel Independence in Hierarchical Graph Transformationeover, the more general structure of hierarchical graphs and of transformation rules leads to a refined condition, termed fragmented parallel independence, which subsumes both parallel independence and non-critical overlap as special cases.作者: 過分自信 時間: 2025-3-30 15:37 作者: pulmonary 時間: 2025-3-30 18:03 作者: 托運(yùn) 時間: 2025-3-31 00:36
The Potential of a Chemical Graph Transformation Systemphs and chemical graph transformations, is suggested. The authors hope that this paper will provide inspiration for researchers involved in graph transformation who might be interested in chemoinformatic applications.作者: guzzle 時間: 2025-3-31 03:29
Stochastic Graph Transformation Systemsransformation systems..Consequently, in this paper we introduce stochastic graph transformation systems, following the outline of stochastic Petri nets. Besides the basic definition and a motivating example, we discuss the analysis of properties expressed in continuous stochastic logic including an experimental tool chain.作者: Cosmopolitan 時間: 2025-3-31 07:25 作者: Mendicant 時間: 2025-3-31 12:45
Mobile Media Technologies and Poiēsise with large specifications showed that packages alone are not sufficient and therefore we have developed concepts for modularizing and coupling specifications. Our graph database provides the runtime-support required by these concepts.作者: Buttress 時間: 2025-3-31 15:20 作者: 修飾 時間: 2025-3-31 20:49
https://doi.org/10.1007/978-0-387-78263-8t but can be exponential in the number of rule applications. The second program is a refinement of the first which is essentially deterministic and uses at most a quadratic number of rule applications.作者: 持續(xù) 時間: 2025-4-1 00:15
https://doi.org/10.1007/978-3-476-04854-7r. The main lesson learned is that the size of the query graph is not the dominating factor, but its cycle rank..Although a number of our results hold specifically for undirected, unlabelled graphs, we propose a more general framework and give some preliminary results for more general cases, where the graphs are labelled with elements of a group.作者: Perigee 時間: 2025-4-1 03:35 作者: indubitable 時間: 2025-4-1 09:03
Concepts for Specifying Complex Graph Transformation Systemse with large specifications showed that packages alone are not sufficient and therefore we have developed concepts for modularizing and coupling specifications. Our graph database provides the runtime-support required by these concepts.作者: 違抗 時間: 2025-4-1 11:16 作者: 地牢 時間: 2025-4-1 16:06
Towards Graph Programs for Graph Algorithmst but can be exponential in the number of rule applications. The second program is a refinement of the first which is essentially deterministic and uses at most a quadratic number of rule applications.
