書目名稱Graph Transformation, Specifications, and Nets影響因子(影響力)學(xué)科排名
書目名稱Graph Transformation, Specifications, and Nets網(wǎng)絡(luò)公開度
書目名稱Graph Transformation, Specifications, and Nets網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Transformation, Specifications, and Nets被引頻次
書目名稱Graph Transformation, Specifications, and Nets被引頻次學(xué)科排名
書目名稱Graph Transformation, Specifications, and Nets年度引用
書目名稱Graph Transformation, Specifications, and Nets年度引用學(xué)科排名
書目名稱Graph Transformation, Specifications, and Nets讀者反饋
書目名稱Graph Transformation, Specifications, and Nets讀者反饋學(xué)科排名
作者: 危機(jī) 時(shí)間: 2025-3-21 23:02 作者: NATAL 時(shí)間: 2025-3-22 03:06
https://doi.org/10.1007/978-3-662-08178-5Hartmut Ehrig was an active researcher in Algebraic Specifications on the one hand and Graph and Model Transformations on the other hand. We demonstrate that these two research fields are closely connected, if we consider . graph transformations only and use . instead of total algebras as the underlying category.作者: reserve 時(shí)間: 2025-3-22 07:37 作者: 雜役 時(shí)間: 2025-3-22 08:48 作者: etiquette 時(shí)間: 2025-3-22 15:52
Model Transformations as Free Constructions,Hartmut Ehrig was an active researcher in Algebraic Specifications on the one hand and Graph and Model Transformations on the other hand. We demonstrate that these two research fields are closely connected, if we consider . graph transformations only and use . instead of total algebras as the underlying category.作者: etiquette 時(shí)間: 2025-3-22 19:39 作者: 輕信 時(shí)間: 2025-3-23 01:15
https://doi.org/10.1007/978-94-017-2290-2 static analysis techniques like Critical Pair Analysis. We propose a new categorical condition of parallel independence and show its equivalence with two other conditions proposed in the literature, for both left-linear and non-left-linear rules. Next we present some preliminary experimental result作者: JIBE 時(shí)間: 2025-3-23 02:20 作者: Custodian 時(shí)間: 2025-3-23 05:34 作者: Prophylaxis 時(shí)間: 2025-3-23 11:58
https://doi.org/10.1007/978-3-322-83289-4te rules are used to manipulate graphs. These rules are given by a left-hand side and a right-hand side graph and the application comprises matching the left-hand side and replacing it with the right-hand side of the rule..In this contribution we give a tutorial on graph transformation that explains作者: 夾死提手勢(shì) 時(shí)間: 2025-3-23 16:43 作者: Ceramic 時(shí)間: 2025-3-23 20:53 作者: 門閂 時(shí)間: 2025-3-24 00:13
https://doi.org/10.1007/978-3-662-08175-4mal manner. The algebraic approach to GT is based on category theory, allowing the instantiation of theoretical results to multiple graph-like structures (e.g. labelled or attributed graphs, Petri nets, even transformation rules themselves). There exists a rich theory of algebraic GT which underlies作者: BRIEF 時(shí)間: 2025-3-24 04:19 作者: Ferritin 時(shí)間: 2025-3-24 10:26 作者: Parabola 時(shí)間: 2025-3-24 13:15 作者: 刺耳的聲音 時(shí)間: 2025-3-24 18:25
https://doi.org/10.1007/978-3-662-08837-1esents the data domain, rather than as tuples of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the advantage of uniformity and gives more flexibility in defining data abstractions. We show equivalence of our formalisation with the作者: 指耕作 時(shí)間: 2025-3-24 19:32 作者: 天文臺(tái) 時(shí)間: 2025-3-25 00:36
https://doi.org/10.1007/978-3-662-09293-4cal systems or benchmarking graph databases to avoid tedious manual synthesis of models. In the paper, we present a long-term research challenge how to generate graph models specific to a domain which are consistent, diverse, scalable and realistic at the same time..We provide foundations for a clas作者: Bmd955 時(shí)間: 2025-3-25 06:11
Hans Schumann,Manfred Winter,Wolfgang Petz(2) we generalize algebraic operations to diagrammatic operations over graphs, which we call ..Our main objective is to extend the construction of term algebras, i.e., free algebras, for the new setting. The key mechanism for the construction of free graph algebras are pushout-based graph transforma作者: 戲法 時(shí)間: 2025-3-25 10:23
On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches, static analysis techniques like Critical Pair Analysis. We propose a new categorical condition of parallel independence and show its equivalence with two other conditions proposed in the literature, for both left-linear and non-left-linear rules. Next we present some preliminary experimental result作者: 膠水 時(shí)間: 2025-3-25 14:05
Integration of Graph Constraints into Graph Grammars, does there exist a “goal-oriented”?grammar that generates all graphs of the original graph language satisfying the constraint. We solve the filter problem for specific graph grammars and specific graph constraints. As an intermediate step, we construct a constraint automaton accepting exactly the g作者: 考得 時(shí)間: 2025-3-25 19:13 作者: 賄賂 時(shí)間: 2025-3-25 21:28
A Tutorial on Graph Transformation,te rules are used to manipulate graphs. These rules are given by a left-hand side and a right-hand side graph and the application comprises matching the left-hand side and replacing it with the right-hand side of the rule..In this contribution we give a tutorial on graph transformation that explains作者: 匍匐前進(jìn) 時(shí)間: 2025-3-26 02:34 作者: 內(nèi)行 時(shí)間: 2025-3-26 05:20
Towards a Navigational Logic for Graphical Structures,c can be used in the framework of many classes of graphs and graphical structures. It is enough that the category of these structures satisfies certain basic conditions..In a previous paper [.], we extended this logic to be able to deal with graph properties including paths, but this extension was o作者: 一再煩擾 時(shí)間: 2025-3-26 08:54 作者: Deceit 時(shí)間: 2025-3-26 15:16
Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach,tion problems. A variety of algorithms to tackle them have been studied in the last 45 years, many of them based on dynamic programming. A limit of SCSPs is its lack of compositionality and, consequently, it is not possible to represent problem decompositions in the formalism itself. In this paper w作者: LAIR 時(shí)間: 2025-3-26 18:17 作者: 表示向前 時(shí)間: 2025-3-27 00:30 作者: JADED 時(shí)間: 2025-3-27 03:43
Graph Attribution Through Sub-Graphs,esents the data domain, rather than as tuples of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the advantage of uniformity and gives more flexibility in defining data abstractions. We show equivalence of our formalisation with the作者: sorbitol 時(shí)間: 2025-3-27 09:03
On Normal Forms for Structured Specifications with Generating Constraints,as been followed by subsequent results concerning normal forms for structured specifications, typically built from basic specifications using union, translation and hiding. We consider generating constraints as additional specification-building operations and follow and extend the results concerning作者: GRAVE 時(shí)間: 2025-3-27 12:08 作者: Barrister 時(shí)間: 2025-3-27 14:38
Graph Operations and Free Graph Algebras,(2) we generalize algebraic operations to diagrammatic operations over graphs, which we call ..Our main objective is to extend the construction of term algebras, i.e., free algebras, for the new setting. The key mechanism for the construction of free graph algebras are pushout-based graph transforma作者: DEI 時(shí)間: 2025-3-27 20:25 作者: EWE 時(shí)間: 2025-3-27 22:06 作者: 災(zāi)禍 時(shí)間: 2025-3-28 03:05 作者: 彈藥 時(shí)間: 2025-3-28 09:26
https://doi.org/10.1007/978-981-10-8087-6ty of conflicts and dependencies leading to the notions of . and .. Initial conflicts have the important new characteristic that for each given conflict a unique initial conflict exists representing it. We introduce initial conflicts for M-adhesive systems and show that the Completeness Theorem and 作者: 貪婪地吃 時(shí)間: 2025-3-28 12:59
https://doi.org/10.1007/978-3-662-08907-1 that edges have some kind of labels and paths can be specified by associating them to a set of label sequences. Then, after the presentation of that general framework, we show how it can be applied to several classes of graphs. Moreover, we present a set of sound inference rules for reasoning in th作者: neutrophils 時(shí)間: 2025-3-28 14:36 作者: Charlatan 時(shí)間: 2025-3-28 22:44
Integration of Graph Constraints into Graph Grammars,oblem for specific graph grammars and specific graph constraints. As an intermediate step, we construct a constraint automaton accepting exactly the graphs in the graph language that satisfy the constraint.作者: Charlatan 時(shí)間: 2025-3-29 02:25
Multi-view Consistency in UML: A Survey,few methods also address behaviour. We also give a classification of different techniques for multi-view UML/OCL consistency: consistency rules, the system model approach, dynamic meta-modelling, universal logic, and heterogeneous transformation. Finally, we briefly outline a possible comprehensive distributed semantics approach to consistency.作者: 魔鬼在游行 時(shí)間: 2025-3-29 03:46 作者: 合乎習(xí)俗 時(shí)間: 2025-3-29 08:11
On Normal Forms for Structured Specifications with Generating Constraints,ranslation and hiding. We consider generating constraints as additional specification-building operations and follow and extend the results concerning normal forms for the resulting specifications with various forms of generating constraints.作者: 引起痛苦 時(shí)間: 2025-3-29 13:34
e introduce . (SCEPs), an algebraic framework, generalizing SCSPs, which allows for the compositional specification and resolution of (soft) constraint-based problems. This enables the systematic derivation of efficient dynamic programming algorithms for any such problem.作者: Limerick 時(shí)間: 2025-3-29 16:07
https://doi.org/10.1007/978-3-476-03665-0ctical applications. The aim of this paper is to present an overview of reconfigurable Petri nets dealing with several aspects including: the fundamental, theoretical basis, application domains, results at the verification/analysis level as well as practical tools. The paper finally discusses some future research directions.作者: debunk 時(shí)間: 2025-3-29 19:49
Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach,e introduce . (SCEPs), an algebraic framework, generalizing SCSPs, which allows for the compositional specification and resolution of (soft) constraint-based problems. This enables the systematic derivation of efficient dynamic programming algorithms for any such problem.作者: 輕快走過 時(shí)間: 2025-3-30 00:58
Overview of Reconfigurable Petri Nets,ctical applications. The aim of this paper is to present an overview of reconfigurable Petri nets dealing with several aspects including: the fundamental, theoretical basis, application domains, results at the verification/analysis level as well as practical tools. The paper finally discusses some future research directions.作者: aesthetician 時(shí)間: 2025-3-30 07:42 作者: 我不明白 時(shí)間: 2025-3-30 10:24 作者: Fecundity 時(shí)間: 2025-3-30 12:42 作者: liposuction 時(shí)間: 2025-3-30 18:28
https://doi.org/10.1007/978-3-662-07836-5ranslation and hiding. We consider generating constraints as additional specification-building operations and follow and extend the results concerning normal forms for the resulting specifications with various forms of generating constraints.作者: 圍裙 時(shí)間: 2025-3-30 21:41
https://doi.org/10.1007/978-94-017-2290-2rules only, in the Verigraph system, and used them to check parallel independence of pairs of overlapping redexes generated from some sample graph transformation systems over categories of typed graphs.作者: 幾何學(xué)家 時(shí)間: 2025-3-31 03:18 作者: GLOOM 時(shí)間: 2025-3-31 08:22
On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches,rules only, in the Verigraph system, and used them to check parallel independence of pairs of overlapping redexes generated from some sample graph transformation systems over categories of typed graphs.作者: 生命 時(shí)間: 2025-3-31 10:10 作者: 集聚成團(tuán) 時(shí)間: 2025-3-31 13:25
https://doi.org/10.1007/978-3-662-09293-4domain can be generated by model generator transformations in finite steps and ., i.e. any instance model retrieved as a solution satisfies all well-formedness constraints. An experimental evaluation is carried out in the context of a statechart modeling tool to evaluate the trade-off between different characteristics of model generators.作者: CLEAR 時(shí)間: 2025-3-31 19:36
