作者: BALK 時(shí)間: 2025-3-21 23:24 作者: 起來了 時(shí)間: 2025-3-22 01:03
https://doi.org/10.1007/978-3-662-41088-2uages specified by restriction graphs and their relation to type graphs. Second, we extend this basic approach to a type graph logic and, third, to type graphs with annotations. We present decidability results and closure properties for each of the formalisms.作者: 廚師 時(shí)間: 2025-3-22 05:23 作者: 補(bǔ)充 時(shí)間: 2025-3-22 11:22 作者: 無目標(biāo) 時(shí)間: 2025-3-22 15:04 作者: 無目標(biāo) 時(shí)間: 2025-3-22 17:06 作者: FAR 時(shí)間: 2025-3-22 23:15 作者: Palpate 時(shí)間: 2025-3-23 01:50
Fusion Grammars: A Novel Approach to the Generation of Graph Languagesthat fusion grammars can simulate hyperedge replacement grammars that generate connected hypergraphs, that the membership problem is decidable, and that fusion grammars are more powerful than hyperedge replacement grammars.作者: Obligatory 時(shí)間: 2025-3-23 08:39 作者: cringe 時(shí)間: 2025-3-23 13:31
https://doi.org/10.1007/978-3-642-11416-8n to be a conservative extension of . (and thus of the . approach), and we show that it can be extended with standard techniques to attributed graphs. We discuss conditions to ensure a form of locality of transformations, and conditions to ensure that the attribution of transformed graphs is total.作者: Sciatica 時(shí)間: 2025-3-23 17:47 作者: FLIP 時(shí)間: 2025-3-23 20:05
The Pullback-Pushout Approach to Algebraic Graph Transformationn to be a conservative extension of . (and thus of the . approach), and we show that it can be extended with standard techniques to attributed graphs. We discuss conditions to ensure a form of locality of transformations, and conditions to ensure that the attribution of transformed graphs is total.作者: 奇怪 時(shí)間: 2025-3-23 22:45
Geometric Modeling: Consistency Preservation Using Two-Layered Variable Substitutionso abstract embedding data. We show how these variables can be simultaneously used, and we provide syntactic conditions on rules to ensure that they preserve object consistency. This rule-based approach is the cornerstone of Jerboa, a tool that allows a fast and safe prototyping of geometric modelers.作者: infinite 時(shí)間: 2025-3-24 03:22 作者: 未開化 時(shí)間: 2025-3-24 10:03
GRAPE – A Graph Rewriting and Persistence Enginecombines the ease of use of a textual DSL with a graphical visualization that is inlined with the program code when needed to aid comprehension and documentation of graph rewriting rules. Moreover, . supports persistence, programmed transactions and backtracking.作者: 狂熱語言 時(shí)間: 2025-3-24 12:19
The Pullback-Pushout Approach to Algebraic Graph Transformationf items of the host graph. We pursue further this trend by proposing the Pullback-Pushout (.) Approach, where we combine smoothly the classical modifications to a host graph specified by a rule (a span of graph morphisms) with the cloning of structures specified by another rule. The approach is show作者: 天文臺(tái) 時(shí)間: 2025-3-24 18:52 作者: meditation 時(shí)間: 2025-3-24 19:06 作者: PACT 時(shí)間: 2025-3-25 02:50 作者: floodgate 時(shí)間: 2025-3-25 05:22 作者: 昏暗 時(shí)間: 2025-3-25 09:50 作者: Choreography 時(shí)間: 2025-3-25 14:46
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammarsrammars, which generalizes the concepts of SLR(1) string parsing to graphs. PSR parsers run in linear space and time. In comparison to the predictive top-down (PTD) parsers recently developed by the authors, PSR parsing is more efficient and more general, while the required grammar analysis is easie作者: 粗魯?shù)娜?nbsp; 時(shí)間: 2025-3-25 18:07
Granularity of Conflicts and Dependencies in Graph Transformation Systems system. The state-of-the-art CDA technique, critical pair analysis, provides its users the benefits of completeness, i.e., its output contains a precise representation?of each potential conflict and dependency in a minimal context, called .. Yet, user feedback has shown that critical pairs can be h作者: Carbon-Monoxide 時(shí)間: 2025-3-25 23:05 作者: aneurysm 時(shí)間: 2025-3-26 01:34
Probabilistic Timed Graph Transformation Systems interconnect the today unconnected systems via complex software parts and the service-oriented paradigm. Therefore besides timed behavior and probabilistic behavior also structure dynamics, where the architecture can be subject to changes at run-time, e.g. when dynamic binding of service end-points作者: SSRIS 時(shí)間: 2025-3-26 07:14
Leveraging Incremental Pattern Matching Techniques for Model Synchronisatione typically a set of . graph transformations from direction-agnostic TGG rules to realise .. In addition to these derived graph transformations, however, further runtime analyses are required to calculate the consequences of model changes in a synchronisation run. This part of TGG-based synchronisat作者: Osteoporosis 時(shí)間: 2025-3-26 10:51
Henshin: A Usability-Focused Framework for EMF Model Transformation Developmentt state of Henshin, a model transformation language and framework based on algebraic graph transformations. Our demonstration focuses on Henshin’s novel usability-oriented features, specifically: (i) a textual syntax, complementing the existing graphical one by improved support for rapid transformat作者: Suggestions 時(shí)間: 2025-3-26 13:44
GRAPE – A Graph Rewriting and Persistence Engineas graph transformations or graph rewriting rules and a rich theoretical underpinning has been developed in the research community that supports reasoning about the properties of graph transformation systems. Various tools exist for developing graph transformations, including visual editors as well 作者: 親密 時(shí)間: 2025-3-26 20:32 作者: SOBER 時(shí)間: 2025-3-26 23:35 作者: POINT 時(shí)間: 2025-3-27 05:11
https://doi.org/10.1007/978-1-59259-692-8r nodes or subgraphs. There have been several suggestions to hierarchical graphs that differ in terms of the underlying graph type, the elements that are structured and the way the structuring is achieved. In this contribution we aim at a more general notion of hierarchical structures for graphs. We作者: obscurity 時(shí)間: 2025-3-27 08:22
https://doi.org/10.1007/978-3-319-42139-1ex, edge, face, etc.) and their embeddings (. relevant data: vertex positions, face colors, volume densities, etc.). Graph transformations with variables allow us to generically handle those operations. We use two types of variables: orbit variables to abstract topological cells and node variables t作者: Homocystinuria 時(shí)間: 2025-3-27 10:10 作者: travail 時(shí)間: 2025-3-27 15:32
https://doi.org/10.1007/978-3-662-41088-2 where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph. In this context, we also study languages specified by restriction graphs and their relation to type graphs. Second, we extend this basic approach to a type graph logic and, third, to ty作者: 預(yù)定 時(shí)間: 2025-3-27 20:10
Francis C. Wells,Robert H. Andersond by the observation that many large and complex structures can be seen as compositions of a large number of small basic pieces. A fusion grammar is a hypergraph grammar that provides the small pieces as connected components of the start hypergraph. To get arbitrary large numbers of them, they can b作者: ANA 時(shí)間: 2025-3-28 01:40 作者: deadlock 時(shí)間: 2025-3-28 05:29 作者: Evolve 時(shí)間: 2025-3-28 09:41
https://doi.org/10.1007/978-3-658-11623-1arly if systems with many possible initial graphs and large or infinite state spaces are concerned. One approach that tries to overcome these limitations is inductive invariant checking. However, the verification of inductive invariants often requires extensive knowledge about the system in question作者: 喃喃訴苦 時(shí)間: 2025-3-28 14:29 作者: 外向者 時(shí)間: 2025-3-28 18:14
https://doi.org/10.1007/978-3-662-22168-6e typically a set of . graph transformations from direction-agnostic TGG rules to realise .. In addition to these derived graph transformations, however, further runtime analyses are required to calculate the consequences of model changes in a synchronisation run. This part of TGG-based synchronisat作者: 灌輸 時(shí)間: 2025-3-28 21:22 作者: 真繁榮 時(shí)間: 2025-3-29 00:50
https://doi.org/10.1007/978-3-662-22172-3as graph transformations or graph rewriting rules and a rich theoretical underpinning has been developed in the research community that supports reasoning about the properties of graph transformation systems. Various tools exist for developing graph transformations, including visual editors as well 作者: Halfhearted 時(shí)間: 2025-3-29 06:43 作者: TRAWL 時(shí)間: 2025-3-29 10:56
https://doi.org/10.1007/978-3-7985-1867-4rammars, which generalizes the concepts of SLR(1) string parsing to graphs. PSR parsers run in linear space and time. In comparison to the predictive top-down (PTD) parsers recently developed by the authors, PSR parsing is more efficient and more general, while the required grammar analysis is easier than for PTD parsing.作者: 仲裁者 時(shí)間: 2025-3-29 12:06 作者: otic-capsule 時(shí)間: 2025-3-29 15:32
Graph Transformation978-3-319-61470-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 彩色的蠟筆 時(shí)間: 2025-3-29 20:02 作者: 秘方藥 時(shí)間: 2025-3-30 01:37
Granularity of Conflicts and Dependencies in Graph Transformation Systemsm can be extended?to?at?least one . and, conversely, each conflict reason is covered by atoms. Moreover, we relate conflict atoms to ., representing smallest element sets to be overlapped in order to obtain a pair of conflicting transformations. We show how conflict reasons are related to critical p作者: left-ventricle 時(shí)間: 2025-3-30 07:46
-Inductive Invariant Checking for Graph Transformation Systemst of additional properties..To analyze possibly infinite systems in a finite fashion, we introduce a symbolic encoding for transformation traces using a restricted form of nested application conditions. As its central contribution, this paper then presents a formal approach and algorithm to verify g作者: 名字的誤用 時(shí)間: 2025-3-30 10:02 作者: ATOPY 時(shí)間: 2025-3-30 16:09
Leveraging Incremental Pattern Matching Techniques for Model Synchronisationcher. As a result, a TGG-based synchroniser is reduced to a component reacting solely to appearing and disappearing matches. This abstracts high-level synchronisation goals from low-level details of handling model changes, providing a viable and unifying foundation for a new generation of TGG tools.作者: Dictation 時(shí)間: 2025-3-30 17:03
https://doi.org/10.1007/978-1-4020-6714-3raph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemica作者: 繁重 時(shí)間: 2025-3-30 22:31
https://doi.org/10.1007/978-3-642-76344-1m can be extended?to?at?least one . and, conversely, each conflict reason is covered by atoms. Moreover, we relate conflict atoms to ., representing smallest element sets to be overlapped in order to obtain a pair of conflicting transformations. We show how conflict reasons are related to critical p作者: 不溶解 時(shí)間: 2025-3-31 03:52
https://doi.org/10.1007/978-3-658-11623-1t of additional properties..To analyze possibly infinite systems in a finite fashion, we introduce a symbolic encoding for transformation traces using a restricted form of nested application conditions. As its central contribution, this paper then presents a formal approach and algorithm to verify g作者: Hemodialysis 時(shí)間: 2025-3-31 06:26
K?niglichen Aufsichts-Kommissional model of PTGTSs in this paper and present a mapping of models with finite state spaces to probabilistic timed automata (PTA) that allows to use the PRISM model checker to analyze PTGTS models with respect to PTCTL properties.
