書目名稱Graph Transformations in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph Transformations in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph Transformations in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Transformations in Computer Science被引頻次
書目名稱Graph Transformations in Computer Science被引頻次學(xué)科排名
書目名稱Graph Transformations in Computer Science年度引用
書目名稱Graph Transformations in Computer Science年度引用學(xué)科排名
書目名稱Graph Transformations in Computer Science讀者反饋
書目名稱Graph Transformations in Computer Science讀者反饋學(xué)科排名
作者: 脾氣暴躁的人 時間: 2025-3-21 21:43
https://doi.org/10.1007/978-3-658-43265-2 local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.作者: Fracture 時間: 2025-3-22 02:40
https://doi.org/10.1007/978-3-531-92287-4 underlying categories of HLR-systems. These results are specialized to graphs, hypergraphs, Petri nets, algebraic specifications and others by classifying the underlying categories with respect to the assumptions. This leads to interesting new results for most of the corresponding HLR-systems.作者: 帶子 時間: 2025-3-22 04:49
Canonical derivations for high-level replacement systems, underlying categories of HLR-systems. These results are specialized to graphs, hypergraphs, Petri nets, algebraic specifications and others by classifying the underlying categories with respect to the assumptions. This leads to interesting new results for most of the corresponding HLR-systems.作者: Intruder 時間: 2025-3-22 12:24
https://doi.org/10.1007/978-3-663-05992-9SPACE complete for arbitrary formulas. Moreover, the method works for these logics extended with operators for distributed and common knowledge, which otherwise cause a complexity increase to exponential time for the satisfiability problem.作者: 隨意 時間: 2025-3-22 14:42
Decomposability helps for deciding logics of knowledge and belief,SPACE complete for arbitrary formulas. Moreover, the method works for these logics extended with operators for distributed and common knowledge, which otherwise cause a complexity increase to exponential time for the satisfiability problem.作者: 隨意 時間: 2025-3-22 19:20 作者: LUCY 時間: 2025-3-23 00:01
A computational model for generic graph functions, local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.作者: Leaven 時間: 2025-3-23 05:02
https://doi.org/10.1007/978-3-658-12810-4f the first and second systems, while the relationship between the second and the third one is sketched. The last system provides an abstract description of the compiled code of the LANAM, which is outlined.作者: 殖民地 時間: 2025-3-23 06:38 作者: 敲詐 時間: 2025-3-23 10:49
Mobilizing Resources in Latin Americartial order among objects in the same computation, while its mutual exclusion relation provides a way of expressing nondeterministic information. Such information can be of great help to a scheduler while trying to find an efficient execution of the program, or also to a compile-time optimizer.作者: 爆炸 時間: 2025-3-23 15:20 作者: 極小 時間: 2025-3-23 19:38
Parallelism in single-pushout graph rewriting,which is uniquely determined up to a suitable notion of isomorphism between derivations and which realizes maximal parallelism also in single-pushout rewriting. The amount of parallelism, however, which we find in these so-called canonical sequences considerably exceeds the parallelism obtained in the double-pushout framework.作者: mitral-valve 時間: 2025-3-23 23:10
Contextual occurrence nets and concurrent constraint programming,rtial order among objects in the same computation, while its mutual exclusion relation provides a way of expressing nondeterministic information. Such information can be of great help to a scheduler while trying to find an efficient execution of the program, or also to a compile-time optimizer.作者: Trabeculoplasty 時間: 2025-3-24 02:55 作者: 有雜色 時間: 2025-3-24 09:00
Decomposability helps for deciding logics of knowledge and belief,e . and treewidth . can be decided in time .), where . is a double exponential function. This result holds not only for the logics S5 and KD45 with NP-complete decision problems, but also for extensions to multiple agents as in the standard logics .., .., .., .. and .., whose decision problems are P作者: 內(nèi)部 時間: 2025-3-24 14:10 作者: Decrepit 時間: 2025-3-24 17:11 作者: 談判 時間: 2025-3-24 20:13 作者: 顯微鏡 時間: 2025-3-24 23:50 作者: machination 時間: 2025-3-25 07:02 作者: Yag-Capsulotomy 時間: 2025-3-25 07:52
A computational model for generic graph functions,hine instances that each are in a state and point to two nodes of a graph. During the execution of a step, the machine instances perform in parallel a local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express 作者: Orgasm 時間: 2025-3-25 12:19 作者: 先驅(qū) 時間: 2025-3-25 19:05
Single pushout transformations of equationally defined graph structures with applications to actor ements on graph structures modelling computational states could nicely be expressed as conditional equations..These and other examples lead then to a general investigation of single pushout transformations within categories of equationally defined graph structures i.e., certain algebras satisfying a作者: Carcinogen 時間: 2025-3-25 21:23 作者: Pastry 時間: 2025-3-26 04:02
Contextual occurrence nets and concurrent constraint programming,ual net where context conditions, besides pre- and post-conditions, are allowed. Context conditions are just items which have to be present in order for an event to take place, but which are not affected by the event. They are very useful for describing situations where different events share a comm作者: ferment 時間: 2025-3-26 06:17
Uniform-modelling in graph grammar specifications,2,SW92/ we ideally proceed as follows: (1) We specify the internal behavior of tools by graph grammars, (2) we edit, analyze, and (in the near future) execute such specifications thereby verifying and prototyping them, (3) we derive efficient components for specified ones by a generator machinery, a作者: osteoclasts 時間: 2025-3-26 10:47
https://doi.org/10.1007/978-3-658-03006-3ely mix graphical and textual formulation of a query. We show how syntax and semantics of this hybrid language are formally defined by means of a slightly extended version of PROGRES, a specification formalism based on programmed and attributed graph rewriting systems.作者: 阻塞 時間: 2025-3-26 15:54
https://doi.org/10.1007/978-3-663-05992-9e . and treewidth . can be decided in time .), where . is a double exponential function. This result holds not only for the logics S5 and KD45 with NP-complete decision problems, but also for extensions to multiple agents as in the standard logics .., .., .., .. and .., whose decision problems are P作者: Insatiable 時間: 2025-3-26 17:54
Mobilit?t und digitale Transformationebraic graph rewrite rules in a certain category of labeled graphs. Our approach allows to separate actions which affect several processes from local changes such as variable bindings. We also sketch how to derive an implementation from this specification.作者: Instantaneous 時間: 2025-3-27 00:26
https://doi.org/10.1007/978-3-663-01176-7ut graphs and graph derivations without worrying about representation-dependent details..Motivated by a research activity aimed at providing graph grammars with a truly-concurrent semantics, we front in this paper the problem of formalizing what does it mean precisely to reason about graph derivatio作者: 不給啤 時間: 2025-3-27 04:14
https://doi.org/10.1007/978-3-663-10820-7ow to extend some relevant properties of concrete derivations to abstract ones. This is the main motivation for the introduction of . of graphs, which are used to define a (more restricted) notion of equivalence among graph morphisms, direct derivations and graph derivations. The properties of the r作者: avulsion 時間: 2025-3-27 07:49 作者: hermetic 時間: 2025-3-27 12:20 作者: LATE 時間: 2025-3-27 16:05
https://doi.org/10.1007/978-3-658-43265-2hine instances that each are in a state and point to two nodes of a graph. During the execution of a step, the machine instances perform in parallel a local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express 作者: BATE 時間: 2025-3-27 18:02
https://doi.org/10.1007/978-3-031-16423-1 of partial morphisms between them. An existence theorem of pushouts in the category of relational structures and their partial morphisms is proved under a certian functorial condition, and it enables us to discuss single pushout rewritings of relational structures.作者: 夸張 時間: 2025-3-28 00:17 作者: incubus 時間: 2025-3-28 04:55 作者: 易達(dá)到 時間: 2025-3-28 06:22
Mobilizing Resources in Latin Americaual net where context conditions, besides pre- and post-conditions, are allowed. Context conditions are just items which have to be present in order for an event to take place, but which are not affected by the event. They are very useful for describing situations where different events share a comm作者: Medley 時間: 2025-3-28 14:17
https://doi.org/10.1057/97811374726322,SW92/ we ideally proceed as follows: (1) We specify the internal behavior of tools by graph grammars, (2) we edit, analyze, and (in the near future) execute such specifications thereby verifying and prototyping them, (3) we derive efficient components for specified ones by a generator machinery, a作者: 邪惡的你 時間: 2025-3-28 14:36 作者: Fortuitous 時間: 2025-3-28 22:30
https://doi.org/10.1007/978-3-658-03006-3ely mix graphical and textual formulation of a query. We show how syntax and semantics of this hybrid language are formally defined by means of a slightly extended version of PROGRES, a specification formalism based on programmed and attributed graph rewriting systems.作者: Feckless 時間: 2025-3-29 00:34 作者: mutineer 時間: 2025-3-29 05:10
https://doi.org/10.1007/978-3-031-16423-1 of partial morphisms between them. An existence theorem of pushouts in the category of relational structures and their partial morphisms is proved under a certian functorial condition, and it enables us to discuss single pushout rewritings of relational structures.作者: 倔強一點 時間: 2025-3-29 07:20 作者: chastise 時間: 2025-3-29 14:23 作者: nutrition 時間: 2025-3-29 17:37
Relational structures and their partial morphisms in view of single pushout rewriting, of partial morphisms between them. An existence theorem of pushouts in the category of relational structures and their partial morphisms is proved under a certian functorial condition, and it enables us to discuss single pushout rewritings of relational structures.作者: 輕而薄 時間: 2025-3-29 20:09
https://doi.org/10.1007/978-3-658-35781-8The notion of term graph rewrite system (TGRS) is extended with a . mechanism. By analyzing this mechanism, a confluence result is obtained for these so-called . (C-TGRS). Some ideas on the use of lazy copying in practice are presented.作者: LAVE 時間: 2025-3-30 01:40 作者: 方舟 時間: 2025-3-30 04:34 作者: 殘忍 時間: 2025-3-30 10:00
https://doi.org/10.1007/978-3-658-20953-7ESM systems are graph rewriting systems where productions are morphisms in a suitable category, ESM. The way graphs are transformed in ESM systems is essentially the same as in actor grammars, which were introduced in [JR]. It is demonstrated that a rewriting step corresponds to a (single) pushout construction, as in the approach from作者: lymphoma 時間: 2025-3-30 15:51
Federica G. Pedriali,Cristina SavettieriA semantics of Statecharts based on graph rewriting is presented. State-charts are formalized as graph replacement rules. The graph of derivations gives a sequential semantics which agrees with Statechart step semantics.作者: surrogate 時間: 2025-3-30 19:16
Extending graph rewriting with copying,The notion of term graph rewrite system (TGRS) is extended with a . mechanism. By analyzing this mechanism, a confluence result is obtained for these so-called . (C-TGRS). Some ideas on the use of lazy copying in practice are presented.作者: encomiast 時間: 2025-3-30 22:46
Recognizable sets of graphs of bounded tree-width,We establish that a set of finite graphs of tree-width at most . is recognizable (with respect to the algebra of graphs with an unbounded number of sources) . it is recognizable with respect to the algebra of graphs with at most . sources. We obtain a somewhat stronger result for sets of simple finite graphs of tree-width at most ..作者: BRACE 時間: 2025-3-31 04:57
Graphs and designing,In this paper the idea of defining graphical models or pictures by specifying their logical structures (graphs) and the possible ways of realization of such structures (realization schemes) is presented. The fact that the structure of the object is independent of its realization may be useful in the process of designing.作者: 涂掉 時間: 2025-3-31 05:32
ESM systems and the composition of their computations,ESM systems are graph rewriting systems where productions are morphisms in a suitable category, ESM. The way graphs are transformed in ESM systems is essentially the same as in actor grammars, which were introduced in [JR]. It is demonstrated that a rewriting step corresponds to a (single) pushout construction, as in the approach from作者: 食物 時間: 2025-3-31 11:40
Semantics of full statecharts based on graph rewriting,A semantics of Statecharts based on graph rewriting is presented. State-charts are formalized as graph replacement rules. The graph of derivations gives a sequential semantics which agrees with Statechart step semantics.作者: Ceramic 時間: 2025-3-31 15:37
Abstract graph derivations in the double pushout approach,, respectively. Three new equivalences are introduced, the third of which is shown to be satisfy both requirements. We also define a new category having the abstract derivations as arrows, which is, in our view, a fundamental step towards the definition of a truly-concurrent semantics for graph gram作者: Fibrinogen 時間: 2025-3-31 20:11
Single pushout transformations of equationally defined graph structures with applications to actor so-called local equations in particular, interesting graph transformation results carry over to the new setting. The use and the effects of such equations are illustrated and discussed for corresponding graph grammar modellings of a client/server problem considered as an actor system.作者: 魔鬼在游行 時間: 2025-4-1 00:15 作者: 有花 時間: 2025-4-1 03:17
https://doi.org/10.1007/978-3-663-01176-7, respectively. Three new equivalences are introduced, the third of which is shown to be satisfy both requirements. We also define a new category having the abstract derivations as arrows, which is, in our view, a fundamental step towards the definition of a truly-concurrent semantics for graph gram作者: Overstate 時間: 2025-4-1 07:29 作者: NEX 時間: 2025-4-1 10:26
https://doi.org/10.1057/9781137472632spec consisting of different components. We call such a generally applicable approach ’uniform modelling’. The paper sketches three ways of uniform modelling in graph grammar specs. Whereas in the first approach we are directly dealing with a gra gra spec, in the second and third approach we are onl
