作者: muffler 時間: 2025-3-21 21:38 作者: 沙發(fā) 時間: 2025-3-22 02:09 作者: 不妥協(xié) 時間: 2025-3-22 07:51
On the Complexity of Simulating Probabilistic Timed Graph Transformation Systemsds. We show that the worst-case amortized complexity per simulation step is only logarithmic in the number of active collaborating systems (like vehicles) and constant concerning the size of the topology. The theoretical results are confirmed by experiments.作者: 小步走路 時間: 2025-3-22 09:50
Mitbestimmung und Arbeiterbildungd the Parikh theorem have no place for hypergraph Lambek grammars. Besides, it can be shown that hypergraph Lambek grammars are NP-complete, so they constitute an attractive alternative to HRGs, which are also NP-complete.作者: Lignans 時間: 2025-3-22 14:27
Mitbestimmung und Demokratisierung returned ETs are . since each possible ET subsumes one of the returned ETs and . by not containing superfluous ETs subsuming smaller ETs. We apply an implementation of our ET generation procedure in the tool . to a running example.作者: Lignans 時間: 2025-3-22 19:49 作者: 雀斑 時間: 2025-3-22 23:52 作者: RADE 時間: 2025-3-23 04:47 作者: Fissure 時間: 2025-3-23 06:16 作者: habile 時間: 2025-3-23 12:59 作者: BIAS 時間: 2025-3-23 16:17
Graph Rewriting and Relabeling with PBPO the embedding of the pattern in the host graph, which is important for a large class of graph rewrite systems. In addition, we show that PBPO. is well-suited for rewriting labeled graphs and certain classes of attributed graphs. For this purpose, we employ a lattice structure on the label set and u作者: evaculate 時間: 2025-3-23 19:56 作者: 颶風 時間: 2025-3-24 00:57
Powerful and NP-Complete: Hypergraph Lambek Grammarshey are equivalent in the sense that they generate the same set of languages (disregarding the empty word). It is well known that context-free grammars can be generalized to hyperedge replacement grammars (HRGs) preserving their main principles and properties. In this paper, we study a generalizatio作者: 短程旅游 時間: 2025-3-24 03:38
Evaluation Diversity for Graph Conditions . of Graph Conditions (GCs). The . of a graph against a GC results in a satisfaction judgement on whether the graph is specified by the GC. . is as expressive as first-order logic on graphs and infinitely many graphs may be evaluated against a given GC. Therefore, a complete compact overview of . a作者: acolyte 時間: 2025-3-24 09:23
Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matchingring. In particular in the context of model driven engineering, where the same query is executed frequently over an evolving graph structure, incremental techniques based on discrimination networks such as RETE nets are a popular solution. However, the construction of adequate RETE nets for a specif作者: 地牢 時間: 2025-3-24 12:43
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammarsr practical modeling. We define top-down parsing for CHR grammars by graph transformation, and prove that it is correct as long as the generation and use of context nodes in productions does not create cyclic dependencies. An efficient predictive version of this algorithm can be obtained as in the c作者: Slit-Lamp 時間: 2025-3-24 16:37 作者: Offensive 時間: 2025-3-24 19:57 作者: A簡潔的 時間: 2025-3-25 01:34 作者: 表被動 時間: 2025-3-25 06:07 作者: 果仁 時間: 2025-3-25 08:11 作者: 無情 時間: 2025-3-25 13:28 作者: 抒情短詩 時間: 2025-3-25 17:33 作者: nuclear-tests 時間: 2025-3-25 22:12 作者: Predigest 時間: 2025-3-26 00:52 作者: 正常 時間: 2025-3-26 07:32
https://doi.org/10.1007/978-3-531-91655-2h that a wider spectrum of data structures becomes available on which reaction systems can be based. Many types of graphs, hypergraphs, and graph-like structures are covered. As a class of suitable categories, .-categories have been introduced, which are closely related to well-known adhesive catego作者: 大都市 時間: 2025-3-26 11:30 作者: insurgent 時間: 2025-3-26 15:13
https://doi.org/10.1007/978-3-663-00172-0osed that instead prove the . of bugs by means of ., which has the promise of better scalability. In this paper, we present an under-approximate program logic for a nondeterministic graph programming language, and show how it can be used to reason deductively about program incorrectness, whether def作者: SMART 時間: 2025-3-26 17:22 作者: LASH 時間: 2025-3-26 23:43
Mitbestimmung und Demokratisierung . of Graph Conditions (GCs). The . of a graph against a GC results in a satisfaction judgement on whether the graph is specified by the GC. . is as expressive as first-order logic on graphs and infinitely many graphs may be evaluated against a given GC. Therefore, a complete compact overview of . a作者: accessory 時間: 2025-3-27 01:28 作者: 群居男女 時間: 2025-3-27 07:29 作者: Schlemms-Canal 時間: 2025-3-27 13:12 作者: cultivated 時間: 2025-3-27 14:29
https://doi.org/10.1007/978-1-4615-2389-5c puzzles. More explicitly, we consider Sudoku, Hashiwokakero, Arukone, and Maze aka Labyrinth. In these cases, the underlying data structures can be represented by graphs and the puzzles have start configurations and goals besides the solving rules. Sometimes it is meaningful to regulate the rule a作者: FEAS 時間: 2025-3-27 17:54 作者: defile 時間: 2025-3-28 01:09 作者: WAX 時間: 2025-3-28 05:30 作者: 秘方藥 時間: 2025-3-28 10:15
Mitgliedergewinnung im Public Health-Careackward, is .—a question that arises when using graph grammars to guide state space abstractions for analyzing heap-manipulating programs; confluence of the graph reduction system then guarantees the abstraction’s uniqueness. If a graph reduction system is . confluent, our tool provides symbolic rep作者: LOPE 時間: 2025-3-28 13:31 作者: covert 時間: 2025-3-28 17:27
https://doi.org/10.1007/978-3-663-00172-0ined by the presence of forbidden graph structure or by finitely failing executions. We prove this ‘incorrectness logic’ to be sound and complete, and speculate on some possible future applications of it.作者: CRAB 時間: 2025-3-28 21:48 作者: entail 時間: 2025-3-28 23:35
https://doi.org/10.1007/978-3-658-26824-4sh the total correctness of graph programs and are shown to be sound. They allow to verify more programs than is possible with previous approaches. In particular, many programs with nested loops are covered by the calculus.作者: paleolithic 時間: 2025-3-29 05:24 作者: irreducible 時間: 2025-3-29 08:08 作者: 荒唐 時間: 2025-3-29 13:56 作者: 膠水 時間: 2025-3-29 16:08
Verifying Graph Programs with Monadic Second-Order Logicsh the total correctness of graph programs and are shown to be sound. They allow to verify more programs than is possible with previous approaches. In particular, many programs with nested loops are covered by the calculus.作者: hypertension 時間: 2025-3-29 21:38 作者: Flounder 時間: 2025-3-30 00:15 作者: 精致 時間: 2025-3-30 04:44
Miteinander von Kindern und alten Menscheng of some transitions can “regenerate” the mana of others. This allows us to represent the action of catalysts and also of biochemical processes where the byproducts of some chemical reaction are exactly the enzymes that another reaction needs to work.作者: 暗諷 時間: 2025-3-30 10:03 作者: Cerebrovascular 時間: 2025-3-30 15:15
A Generalized Concurrent Rule Construction for Double-Pushout Rewritingosition this new kind of composition of rules among the existing ones and obtain a Generalized Concurrency Theorem for it. We conduct our work in the same generic framework in which the Concurrency Theorem has been presented, namely double-pushout rewriting in .-adhesive categories via rules equipped with application conditions.作者: inflate 時間: 2025-3-30 16:59
Nets with Mana: A Framework for?Chemical Reaction Modellingg of some transitions can “regenerate” the mana of others. This allows us to represent the action of catalysts and also of biochemical processes where the byproducts of some chemical reaction are exactly the enzymes that another reaction needs to work.作者: stroke 時間: 2025-3-30 22:38 作者: 歡樂中國 時間: 2025-3-31 02:50 作者: 結(jié)果 時間: 2025-3-31 06:45
Graph Rewriting and Relabeling with PBPOl-suited for rewriting labeled graphs and certain classes of attributed graphs. For this purpose, we employ a lattice structure on the label set and use order-preserving graph morphisms. We argue that our approach is simpler and more general than related relabeling approaches in the literature.作者: browbeat 時間: 2025-3-31 10:55
Mitarbeiterzeitschriften noch besser machennear double pushout (DPO) rewriting in rm-adhesive categories. Our results open non-linear SqPO and DPO semantics to the rich static analysis techniques available from concurrency, rule algebra and tracelet theory.作者: HEED 時間: 2025-3-31 15:15
https://doi.org/10.1007/978-3-322-85963-1prove the net’s performance with respect to execution time and memory consumption. Furthermore, we suggest a technique for adapting the net structure to changing characteristics of the underlying graph. We evaluate the presented concepts empirically based on queries and data from two independent benchmarks.作者: 防御 時間: 2025-3-31 20:12 作者: IRATE 時間: 2025-3-31 21:52 作者: 闖入 時間: 2025-4-1 05:43 作者: 黃油沒有 時間: 2025-4-1 06:20
Mitbestimmung in Aufsichtsr?tenl-suited for rewriting labeled graphs and certain classes of attributed graphs. For this purpose, we employ a lattice structure on the label set and use order-preserving graph morphisms. We argue that our approach is simpler and more general than related relabeling approaches in the literature.
