作者: Prostaglandins 時(shí)間: 2025-3-21 22:01
J?rg Schlüchtermann,Hermann-Josef Tebrokes conversion. We show that the corresponding labelled transitions systems are bisimular. In an ongoing example reconfigurable Petri nets are used to model and to verify partial dynamic reconfiguration of field programmable gate arrays.作者: Shuttle 時(shí)間: 2025-3-22 02:13
Mittelstandsf?rderung durch ?Planification“?r generates C code for matching rooted graph transformation rules. We present run-time experiments with our implementation in a case study on checking graphs for two-colourability: on grid graphs of up to 100,000 nodes, the compiled GP 2 program is as fast as the tailor-made C program given by Sedgewick.作者: bourgeois 時(shí)間: 2025-3-22 06:16
Sesqui-Pushout Rewriting with Type Refinements transformation rule to refine the underlying type graph. We discuss the relation to the existing approaches to controlled sesqui-pushout vertex cloning, elaborate a basic theoretical framework, and demonstrate its applicability by a practical example.作者: 過于光澤 時(shí)間: 2025-3-22 11:02
Model Checking Reconfigurable Petri Nets with Maudes conversion. We show that the corresponding labelled transitions systems are bisimular. In an ongoing example reconfigurable Petri nets are used to model and to verify partial dynamic reconfiguration of field programmable gate arrays.作者: 神圣在玷污 時(shí)間: 2025-3-22 13:33 作者: 神圣在玷污 時(shí)間: 2025-3-22 18:05
https://doi.org/10.1007/978-3-8349-3833-6ort. Inspired by the paradigms of . and ., we present a tool environment that offers editable views for variants expressed in a variability-based rule. We demonstrate that our tool environment is helpful to address the identified issues, rendering variability-based rules a highly feasible reuse approach.作者: hieroglyphic 時(shí)間: 2025-3-22 22:03
https://doi.org/10.1007/978-3-658-06318-4m best suited for general instances and demonstrate that it is feasible to compute atom-atom maps at large scales using a manually curated database of biochemical reactions as an example. In this context we address the network completion problem.作者: 血友病 時(shí)間: 2025-3-23 04:06
A Tool Environment for Managing Families of Model Transformation Rulesort. Inspired by the paradigms of . and ., we present a tool environment that offers editable views for variants expressed in a variability-based rule. We demonstrate that our tool environment is helpful to address the identified issues, rendering variability-based rules a highly feasible reuse approach.作者: 樹木中 時(shí)間: 2025-3-23 06:27
Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactionsm best suited for general instances and demonstrate that it is feasible to compute atom-atom maps at large scales using a manually curated database of biochemical reactions as an example. In this context we address the network completion problem.作者: 愉快么 時(shí)間: 2025-3-23 13:12 作者: 性冷淡 時(shí)間: 2025-3-23 14:53
Parallelism in AGREE Transformationsdding) may affect the dependencies between two rules applied to the same graph. We extend to AGREE the classical notion of parallel independence between the matches of two rules to the same graph, identifying sufficient conditions that guarantee that two rules can be applied in any order leading to the same result.作者: 致敬 時(shí)間: 2025-3-23 21:30 作者: 刺耳 時(shí)間: 2025-3-23 23:55 作者: 來這真柔軟 時(shí)間: 2025-3-24 05:29
https://doi.org/10.1007/978-3-531-92152-5se. The approach employs graph transformation rules for the nodes of the network and thus we can employ the underlying theory. We further show that the proposed generalized discrimination networks have the same expressive power as nested graph conditions.作者: Angiogenesis 時(shí)間: 2025-3-24 09:54 作者: 浮雕 時(shí)間: 2025-3-24 13:23
A Software Package for Chemically Inspired Graph Transformationes for automatically visualising not only graphs and transformation rules, but also Double Pushout diagrams and graph languages in form of directed hypergraphs. The software is available as an open source package, and interactive examples can be found on the accompanying webpage.作者: Incorruptible 時(shí)間: 2025-3-24 18:47
Rete Network Slicing for Model Querieshe proposed method reuses the structural information encoded in the Rete networks to calculate and present a trace of operations resulting in some model elements to appear in the result set. The approach is illustrated on a running example of validating well-formedness over UML state machine models using graph patterns as a model query formalism.作者: 吞噬 時(shí)間: 2025-3-24 22:58 作者: cinder 時(shí)間: 2025-3-24 23:43
The Incremental Advantage: Evaluating the Performance of a TGG-based Visualisation Frameworkd model transformation tool eMoflon. We argue the advantages of using TGGs for this visualisation application scenario, and provide a quantitative analysis of the runtime complexity and scalability of the realised incremental, unidirectional transformation.作者: 頂點(diǎn) 時(shí)間: 2025-3-25 04:44 作者: 輕信 時(shí)間: 2025-3-25 10:28 作者: NIL 時(shí)間: 2025-3-25 12:09 作者: 作繭自縛 時(shí)間: 2025-3-25 18:07
https://doi.org/10.1007/978-3-658-31523-8nal and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper, we provide such a control mechanism by allowing each作者: 戰(zhàn)役 時(shí)間: 2025-3-25 21:27 作者: candle 時(shí)間: 2025-3-26 03:18 作者: 預(yù)知 時(shí)間: 2025-3-26 05:15
https://doi.org/10.1007/978-3-322-81552-1 a molecule graph is connected and reactions in general involve multiple molecules, the transformation must be performed on multisets of graphs. We present a general software package for this type of graph transformation system, which can be used for modelling chemical systems. The package contains 作者: falsehood 時(shí)間: 2025-3-26 09:16
https://doi.org/10.1007/978-3-8349-3833-6ch to express such families of rules in a compact representation, enabling the convenient editing of multiple rule variants at once. On the downside, this approach gives rises to distinct maintenance drawbacks: Users are required to view and edit presence conditions. The complexity and size of the r作者: 禁止,切斷 時(shí)間: 2025-3-26 13:31
Mittelstandsf?rderung durch ?Planification“?ormation rules and aims to facilitate formal reasoning on programs. Implementing graph programs is challenging because rule matching is expensive in general. GP 2 addresses this problem by providing . rules which under mild conditions can be matched in constant time. Using a search plan, our compile作者: 支形吊燈 時(shí)間: 2025-3-26 20:25 作者: insomnia 時(shí)間: 2025-3-27 00:02
https://doi.org/10.1007/978-3-642-73992-7raint or the calculation of various model metrics. However, their high level nature might make it hard to understand all corner cases of complex queries. When debugging erroneous patterns, a common task is to identify which conditions or constraints of a query caused some model elements to appear in作者: 詩集 時(shí)間: 2025-3-27 04:45
https://doi.org/10.1007/978-3-322-84293-0faces to high-level, declarative languages. In this paper, we describe a novel SQL-based language for modeling high-level graph queries. Our approach is based on graph pattern matching concepts, specifically nested graph conditions with distance constraints, as well as graph algorithms for calculati作者: 忍耐 時(shí)間: 2025-3-27 09:09 作者: restrain 時(shí)間: 2025-3-27 13:20
https://doi.org/10.1007/978-3-642-92047-9itable for unidirectional application scenarios. We believe that it is more useful to regard TGGs as just graph grammars with “batteries included”, meaning that TGG-based tools provide simple, default execution strategies, together with algorithms for incremental change propagation. Especially in ca作者: 呼吸 時(shí)間: 2025-3-27 15:22 作者: 稱贊 時(shí)間: 2025-3-27 19:41
https://doi.org/10.1007/978-3-658-07966-6le based computer game called Perlinoid. In his Bachelor thesis, David developed a level generator for Perlinoid. The challenge was to generate interesting puzzles with a reasonably small number of elements and reasonably complex series of steps required for the solution. Being educated in graph tra作者: 哎呦 時(shí)間: 2025-3-27 23:57 作者: GRIPE 時(shí)間: 2025-3-28 03:45
Sesqui-Pushout Rewriting with Type Refinementsnal and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper, we provide such a control mechanism by allowing each作者: 縮減了 時(shí)間: 2025-3-28 08:11 作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-28 10:27
Model Checking Reconfigurable Petri Nets with Maude of reconfigurable Petri nets. These are Petri nets with a set of rules for changing the net dynamically. We obtain model checking by converting reconfigurable Petri nets to specific Maude modules and using then the LTLR model checker of Maude. The main result of this paper is the correctness of thi作者: Grasping 時(shí)間: 2025-3-28 14:59 作者: Estimable 時(shí)間: 2025-3-28 19:32
A Tool Environment for Managing Families of Model Transformation Rulesch to express such families of rules in a compact representation, enabling the convenient editing of multiple rule variants at once. On the downside, this approach gives rises to distinct maintenance drawbacks: Users are required to view and edit presence conditions. The complexity and size of the r作者: Atrium 時(shí)間: 2025-3-29 00:28 作者: 沒有貧窮 時(shí)間: 2025-3-29 07:02
An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformationsimple transformation rules, this is usually not sufficient for more complex changes. In these situations, the concept of amalgamated transformation has been increasingly often used to model . loops of rule applications which coincide in common core actions. Such a loop can be specified by a kernel r作者: 樹木中 時(shí)間: 2025-3-29 08:37 作者: BLAZE 時(shí)間: 2025-3-29 11:38 作者: 開始從未 時(shí)間: 2025-3-29 16:34
On the Operationalization of Graph Queries with Generalized Discrimination Networkselational database case the relational algebra and generalized discrimination networks have been studied to find appropriate decompositions into subqueries and ordering of these subqueries for query evaluation or incremental updates of queries. For graph database queries however there is no formal u作者: 存在主義 時(shí)間: 2025-3-29 23:44 作者: 核心 時(shí)間: 2025-3-30 01:14 作者: Watemelon 時(shí)間: 2025-3-30 05:11
Using Graph Transformation for Puzzle Game Level Generation and Validationle based computer game called Perlinoid. In his Bachelor thesis, David developed a level generator for Perlinoid. The challenge was to generate interesting puzzles with a reasonably small number of elements and reasonably complex series of steps required for the solution. Being educated in graph tra
