標(biāo)題: Titlebook: ; [打印本頁] 作者: 無緣無故 時間: 2025-3-21 17:30
書目名稱Graph Grammars and Their Application to Computer Science影響因子(影響力)
書目名稱Graph Grammars and Their Application to Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph Grammars and Their Application to Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph Grammars and Their Application to Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Grammars and Their Application to Computer Science被引頻次
書目名稱Graph Grammars and Their Application to Computer Science被引頻次學(xué)科排名
書目名稱Graph Grammars and Their Application to Computer Science年度引用
書目名稱Graph Grammars and Their Application to Computer Science年度引用學(xué)科排名
書目名稱Graph Grammars and Their Application to Computer Science讀者反饋
書目名稱Graph Grammars and Their Application to Computer Science讀者反饋學(xué)科排名
作者: Glaci冰 時間: 2025-3-21 23:38
Wolfgang Karl Hofbauer,Georg G?rtnerTo define NLC grammars for vertex replacement, we provide a categorical framework based on pullbacks in the category of graphs, whose major feature is probably that the . and not distinct of it. We then indicate how it can be used to describe the generation of infinite graphs by recursive equations.作者: 有角 時間: 2025-3-22 00:28 作者: 碌碌之人 時間: 2025-3-22 05:45
A category-theoretical approach to vertex replacement: The generation of infinite graphs,To define NLC grammars for vertex replacement, we provide a categorical framework based on pullbacks in the category of graphs, whose major feature is probably that the . and not distinct of it. We then indicate how it can be used to describe the generation of infinite graphs by recursive equations.作者: 犬儒主義者 時間: 2025-3-22 10:26 作者: 聰明 時間: 2025-3-22 16:22 作者: 聰明 時間: 2025-3-22 18:49
Process specification and verification,uch specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.作者: tolerance 時間: 2025-3-23 00:15
https://doi.org/10.1007/978-3-663-04348-5, is contrasted with term graph rewriting, which works by first gluing in the new part of the graph (the contractum) and performing redirections, and then removing garbage. It is shown that in the algebraic framework these two strategies can be reconciled. This is done by finding a natural analogue 作者: 烤架 時間: 2025-3-23 02:55 作者: 晚來的提名 時間: 2025-3-23 05:34 作者: 宣誓書 時間: 2025-3-23 13:26
https://doi.org/10.1007/978-3-642-96204-2It is shown that a restricted form of graph unification corresponds to solving linear Diophantine equations, and hence is decidable. For graph matching, transformation rules are given which compute all (pure) solutions to a matching problem. The matching concept suggests a new graph rewriting approa作者: 最低點 時間: 2025-3-23 14:09 作者: 沒血色 時間: 2025-3-23 19:51 作者: 發(fā)電機 時間: 2025-3-23 22:26
https://doi.org/10.1007/978-3-662-00449-4ata structures. Unfortunately, pure rule-based approaches are not well prepared for expressing any kind of procedural knowledge. Therefore, various extensions were proposed which regulate the application of rewrite rales. This paper compares already existing regulation mechanisms and proposes a new 作者: Needlework 時間: 2025-3-24 04:04
https://doi.org/10.1007/978-3-642-68747-1cal point of view. The basic idea is to reuse concepts, which are known within or without the graph grammar field, to structure large specifications. These are the concept of distributed graph transformation systems, the concept of inheritance of specifications, and the import-export-interface conce作者: 防水 時間: 2025-3-24 09:11
https://doi.org/10.1007/978-3-662-00644-3environments. Gragras are used as an operational specification method for formally describing the effect of tools on internal configurations of such an environment. We propose anew approach for decomposing large unstructured gragra specifications into coupled modules (subspecifications), sketch how 作者: 平淡而無味 時間: 2025-3-24 12:49
https://doi.org/10.1007/978-3-642-49838-1gnition is a powerful technique for efficiently reconstructing useful design information from existing software. We use a flow graph formalism, which is closely related to hypergraph formalisms, to represent programs and clichés and we use attributed flow graph parsing to automate recognition. The f作者: CLAY 時間: 2025-3-24 17:36
https://doi.org/10.1007/978-3-662-08743-5ssors to take their place. Reconfiguration Graph Grammar (RGG) is introduced as a model supporting the design and analysis of these reconfiguration algorithms. A formal description is given, as well as several theorems, with proofs, concerning the properties of RGG that make it well suited for model作者: 發(fā)怨言 時間: 2025-3-24 19:10
Peter Uwe Witte,Heinrich Matthaeiinto edge-replacement algebras is investigated. Compositions of top-down and bottom-up tree transducers are too weak if the operations in the target algebra are powerful enough to define all series-parallel graphs, 2-trees, or related types of graphs. Tgt transducers are shown to be more powerful. T作者: 翻布尋找 時間: 2025-3-25 00:39 作者: cacophony 時間: 2025-3-25 07:22 作者: Adenoma 時間: 2025-3-25 08:07
https://doi.org/10.1007/978-3-322-90112-5ns. Our aim is to allow (pairs of) productions which are possibly not parallel independent, to be applied in parallel, provided that they are not mutually exclusive. The notion of synchronized composition we propose is not comparable to amalgamation [BFH87], since two productions which are amalgable作者: 不再流行 時間: 2025-3-25 13:43
https://doi.org/10.1007/978-3-322-85956-3ics for these systems is presented, where concurrent histories are represented by process objects, called computation structures. In this paper it is shown that, if one refines the notion of a computation structure in a suitable way, then each computation structure can be decomposed according to an 作者: right-atrium 時間: 2025-3-25 19:01 作者: 背景 時間: 2025-3-25 23:34 作者: 殺死 時間: 2025-3-26 03:44 作者: 大漩渦 時間: 2025-3-26 04:53
Graph unification and matching,It is shown that a restricted form of graph unification corresponds to solving linear Diophantine equations, and hence is decidable. For graph matching, transformation rules are given which compute all (pure) solutions to a matching problem. The matching concept suggests a new graph rewriting approa作者: Malaise 時間: 2025-3-26 10:00 作者: 衰老 時間: 2025-3-26 14:09
A graph rewriting framework for Statecharts semantics,ures. This is exemplified considering Statecharts in a variant allowing dynamic creation of processes. Graph rewriting rules give the semantics of Statecharts in such interpretation. Standard Statecharts semantics can be recovered by suitably restricting derivation sequences that describe behaviours作者: Epithelium 時間: 2025-3-26 18:02
Programmed graph transformations and graph transformation units in GRACE,ata structures. Unfortunately, pure rule-based approaches are not well prepared for expressing any kind of procedural knowledge. Therefore, various extensions were proposed which regulate the application of rewrite rales. This paper compares already existing regulation mechanisms and proposes a new 作者: CAND 時間: 2025-3-27 00:10
Pragmatic and semantic aspects of a module concept for graph transformation systems,cal point of view. The basic idea is to reuse concepts, which are known within or without the graph grammar field, to structure large specifications. These are the concept of distributed graph transformation systems, the concept of inheritance of specifications, and the import-export-interface conce作者: NICE 時間: 2025-3-27 01:19 作者: REIGN 時間: 2025-3-27 07:48
,Using attributed flow graph parsing to recognize clichés in programs,gnition is a powerful technique for efficiently reconstructing useful design information from existing software. We use a flow graph formalism, which is closely related to hypergraph formalisms, to represent programs and clichés and we use attributed flow graph parsing to automate recognition. The f作者: Fierce 時間: 2025-3-27 13:07
Reconfiguration Graph Grammar for massively parallel, fault tolerant computers,ssors to take their place. Reconfiguration Graph Grammar (RGG) is introduced as a model supporting the design and analysis of these reconfiguration algorithms. A formal description is given, as well as several theorems, with proofs, concerning the properties of RGG that make it well suited for model作者: Accessible 時間: 2025-3-27 15:19 作者: harbinger 時間: 2025-3-27 20:49
Process specification and verification,uch specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.作者: 無政府主義者 時間: 2025-3-27 23:32 作者: 轉(zhuǎn)向 時間: 2025-3-28 03:00 作者: indubitable 時間: 2025-3-28 09:33 作者: 六個才偏離 時間: 2025-3-28 14:14 作者: 能得到 時間: 2025-3-28 18:29 作者: Externalize 時間: 2025-3-28 19:22 作者: 瘙癢 時間: 2025-3-29 02:17
The use of tree transducers to compute translations between graph algebras,lgebra are powerful enough to define all series-parallel graphs, 2-trees, or related types of graphs. Tgt transducers are shown to be more powerful. These are able to compute translations into ER algebras whose operations are so-called .. operations, which are generalizations of the well-known operations to generate 2-trees.作者: fledged 時間: 2025-3-29 06:20 作者: 他很靈活 時間: 2025-3-29 10:33 作者: 決定性 時間: 2025-3-29 14:07
https://doi.org/10.1007/978-3-662-63235-2and may be seen as a kind of structured derivation. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts.作者: OVER 時間: 2025-3-29 18:18 作者: foliage 時間: 2025-3-29 22:19 作者: 值得尊敬 時間: 2025-3-30 03:00
https://doi.org/10.1007/978-3-322-90112-5l theory of parallelism in the algebraic approach to graph grammars. Moreover, they can be the basis for the development of a more general concept of canonical derivations, and also for a generalization of the recently developed partial order and event structure semantics for graph grammars.作者: 沒有貧窮 時間: 2025-3-30 06:12 作者: 使饑餓 時間: 2025-3-30 10:40 作者: Facet-Joints 時間: 2025-3-30 13:48 作者: 哀求 時間: 2025-3-30 18:09
Programmed graph transformations and graph transformation units in GRACE,on mechanisms may be defined using a very small set of basic concepts and a recently developed new fixpoint theorem. Having such a common formal background offers the opportunity to combine different regulation mechanisms within the future multi-paradigm graph grammar programming environment GRACE.作者: 嬰兒 時間: 2025-3-31 00:12
,Using attributed flow graph parsing to recognize clichés in programs,o encode aggregate data structure clichés and the abstract operations on them. A chart parsing algorithm is used to solve the problem of determining which clichés in a given cliché library are in a given program.作者: encomiast 時間: 2025-3-31 01:43
Synchronized composition of graph grammar productions,l theory of parallelism in the algebraic approach to graph grammars. Moreover, they can be the basis for the development of a more general concept of canonical derivations, and also for a generalization of the recently developed partial order and event structure semantics for graph grammars.作者: Melatonin 時間: 2025-3-31 06:12 作者: CLAN 時間: 2025-3-31 10:35
