作者: 催眠藥 時間: 2025-3-21 22:50 作者: Veneer 時間: 2025-3-22 00:23
https://doi.org/10.1007/978-3-658-03104-6s are replete with ambiguity, significantly impeding understanding. A formalisation of the essentials of bond graphs is given, together with a formalisation of bond graph transformation, which can directly express abstraction and refinement of bond graphs.作者: avulsion 時間: 2025-3-22 08:22
Moving a?Derivation Along a?Derivation Preserves the?Spinerivation based on parallel and sequential independence on one hand and restriction of a derivation by clipping off vertices and edges that are never matched by a rule application throughout the derivation on the other hand. As main result, it is shown that moving a derivation preserves its spine being the minimal restriction.作者: RAG 時間: 2025-3-22 09:34
Fuzzy Presheaves are Quasitoposest the metatheory of algebraic graph rewriting. In this paper we propose and motivate the notion of ., which generalises fuzzy sets and fuzzy graphs. We prove that fuzzy presheaves are rm-adhesive quasitoposes, proving our recent conjecture for fuzzy graphs. Furthermore, we show that simple fuzzy graph categories are quasitoposes.作者: Crepitus 時間: 2025-3-22 16:21
Formalisation, Abstraction and?Refinement of?Bond Graphss are replete with ambiguity, significantly impeding understanding. A formalisation of the essentials of bond graphs is given, together with a formalisation of bond graph transformation, which can directly express abstraction and refinement of bond graphs.作者: Crepitus 時間: 2025-3-22 20:36 作者: caldron 時間: 2025-3-22 22:27 作者: motor-unit 時間: 2025-3-23 03:17 作者: 冥想后 時間: 2025-3-23 06:05
https://doi.org/10.1007/978-3-662-67801-5avioural metrics, termination probabilities for Markov chains and stochastic games are defined in terms of least or greatest fixpoints. Here we show that our recent work which proposes a technique for checking whether the fixpoint of a function is the least (or the largest) admits a natural categori作者: Fester 時間: 2025-3-23 10:40 作者: Fortify 時間: 2025-3-23 16:53
https://doi.org/10.1007/978-3-658-38044-1 it is natural to think about the desired outcome state, i.e., the desired ., rather than the specific steps required to achieve it; these steps may vary depending on the specific rule-application context. Existing graph-transformation approaches either require a separate rule to be written for ever作者: 即席 時間: 2025-3-23 18:34 作者: PAC 時間: 2025-3-24 01:35
https://doi.org/10.1007/978-3-662-67108-5rphisms targeting them. The method is well-defined in rm-adhesive quasitoposes (which include toposes and therefore many graph categories of interest), and is applicable to non-linear rules. The method is also defined for other frameworks, including DPO and SqPO, because we have previously shown tha作者: 思考才皺眉 時間: 2025-3-24 02:23
Bertelsmann Stiftung,Birgit Riess,Arved Lütht the metatheory of algebraic graph rewriting. In this paper we propose and motivate the notion of ., which generalises fuzzy sets and fuzzy graphs. We prove that fuzzy presheaves are rm-adhesive quasitoposes, proving our recent conjecture for fuzzy graphs. Furthermore, we show that simple fuzzy gra作者: 人類的發(fā)源 時間: 2025-3-24 09:23
Mit Vielfalt und Fairness zum Erfolg to graph transformation: the uniqueness of derivations up to isomorphism and the so-called Church-Rosser theorem. The first result involves proving the uniqueness of pushout complements, first established by Rosen in 1975. The second result formalises Ehrig’s and Kreowski’s proof of 1976 that paral作者: LEVY 時間: 2025-3-24 12:57 作者: Magnificent 時間: 2025-3-24 16:42
https://doi.org/10.1007/978-3-663-05840-3graph databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of graph homomorphisms are specified. Then, the notion of pattern is introduced to represent a kind of recursively defined formula over graphs. The syntax and formal semantics of patte作者: 公理 時間: 2025-3-24 21:02
Christine Sch?nberger,Ernst Kardorff to perform this propagation in a least-changing way that avoids unnecessary deletions (which might cause information loss). From a theoretical point of view, so-called . have been developed that enable provably correct propagation of changes while avoiding information loss. However, to be able to r作者: apiary 時間: 2025-3-25 01:25
https://doi.org/10.1007/978-3-658-33877-0informal description of the BPMN execution semantics leads to different interpretations of BPMN elements and difficulties in checking behavioral properties. In this paper, we propose a formalization of the execution semantics of BPMN that, compared to existing approaches, covers more BPMN elements w作者: 無法治愈 時間: 2025-3-25 07:05
Mit den Mathem?dels durch die Weltle. Our generic parallel BRS algorithm efficiently summarizes large graphs w.r.t. a custom equivalence relation?. defined on the graph’s vertices?.. Moreover, the definition of?. can be chained . times, so the defined equivalence relation becomes a .-bisimulation. We evaluate the runtime and memory 作者: 工作 時間: 2025-3-25 09:09 作者: 代理人 時間: 2025-3-25 14:13 作者: 連鎖,連串 時間: 2025-3-25 19:45 作者: FILTH 時間: 2025-3-25 22:56 作者: Debate 時間: 2025-3-26 03:19 作者: Inflammation 時間: 2025-3-26 07:12 作者: mydriatic 時間: 2025-3-26 09:25
Termination of?Graph Transformation Systems Using Weighted Subgraph Countingrphisms targeting them. The method is well-defined in rm-adhesive quasitoposes (which include toposes and therefore many graph categories of interest), and is applicable to non-linear rules. The method is also defined for other frameworks, including DPO and SqPO, because we have previously shown tha作者: indigenous 時間: 2025-3-26 15:04
Fuzzy Presheaves are Quasitoposest the metatheory of algebraic graph rewriting. In this paper we propose and motivate the notion of ., which generalises fuzzy sets and fuzzy graphs. We prove that fuzzy presheaves are rm-adhesive quasitoposes, proving our recent conjecture for fuzzy graphs. Furthermore, we show that simple fuzzy gra作者: 急急忙忙 時間: 2025-3-26 18:56
Mechanised DPO Theory: Uniqueness of?Derivations and?Church-Rosser Theorem to graph transformation: the uniqueness of derivations up to isomorphism and the so-called Church-Rosser theorem. The first result involves proving the uniqueness of pushout complements, first established by Rosen in 1975. The second result formalises Ehrig’s and Kreowski’s proof of 1976 that paral作者: dragon 時間: 2025-3-26 22:07
Formalisation, Abstraction and?Refinement of?Bond Graphss are replete with ambiguity, significantly impeding understanding. A formalisation of the essentials of bond graphs is given, together with a formalisation of bond graph transformation, which can directly express abstraction and refinement of bond graphs.作者: 親密 時間: 2025-3-27 02:06
A Rule-Based Procedure for?Graph Query Solvinggraph databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of graph homomorphisms are specified. Then, the notion of pattern is introduced to represent a kind of recursively defined formula over graphs. The syntax and formal semantics of patte作者: myopia 時間: 2025-3-27 06:55 作者: 燒烤 時間: 2025-3-27 13:31 作者: PLUMP 時間: 2025-3-27 14:32
Computing ,-Bisimulations for?Large Graphs: A Comparison and?Efficiency Analysisle. Our generic parallel BRS algorithm efficiently summarizes large graphs w.r.t. a custom equivalence relation?. defined on the graph’s vertices?.. Moreover, the definition of?. can be chained . times, so the defined equivalence relation becomes a .-bisimulation. We evaluate the runtime and memory 作者: 挑剔為人 時間: 2025-3-27 19:39 作者: abysmal 時間: 2025-3-28 01:54
Implementing the?, Language: A Functional Language with?Graphs as?First-Class Data leaf-linked trees. They can be abstracted into graphs (or more precisely, port hypergraphs). In existing imperative programming languages, these structures are handled with destructive assignments to heaps as opposed to a purely functional programming style. These low-level operations are prone to 作者: ovation 時間: 2025-3-28 03:10
https://doi.org/10.1007/978-3-658-38044-1ential action is already absent (present), this action need not be performed because the desired outcome is already present. We formally define effect-oriented graph transformation, show how matches can be computed without explicitly enumerating all induced classic rules, and report on a prototypica作者: 不容置疑 時間: 2025-3-28 08:41 作者: 平常 時間: 2025-3-28 11:02
Mit den Mathem?dels durch die Weltorithms on all datasets for all . and for smaller?. in some cases. The BRS implementations of the two bisimulation algorithms run almost as fast as each other. Thus, the BRS algorithm is an effective parallelization of the sequential Kaushik et?al. bisimulation algorithm.作者: thrombus 時間: 2025-3-28 16:21 作者: flaunt 時間: 2025-3-28 21:54 作者: 大喘氣 時間: 2025-3-29 00:54 作者: 地名表 時間: 2025-3-29 07:09 作者: lethal 時間: 2025-3-29 10:58
Computing ,-Bisimulations for?Large Graphs: A Comparison and?Efficiency Analysisorithms on all datasets for all . and for smaller?. in some cases. The BRS implementations of the two bisimulation algorithms run almost as fast as each other. Thus, the BRS algorithm is an effective parallelization of the sequential Kaushik et?al. bisimulation algorithm.作者: modish 時間: 2025-3-29 13:40
Dominant Eigenvalue-Eigenvector Pair Estimation via?Graph Infectionhod and power iteration. Our results show clear advantages over power iteration for tree graphs, bipartite graphs, directed graphs with periods, and Markov chains with spider-traps. To our knowledge, this is the first work that estimates dominant eigenvalue and eigenvector pair from the perspective 作者: Digest 時間: 2025-3-29 18:33 作者: 確定 時間: 2025-3-29 20:30
https://doi.org/10.1007/978-3-642-05064-0emantics of our logics with a computer-assisted formalisation using the proof assistant Agda, and we round up the paper by highlighting the crucial aspects of our formalisation and the practical use of quantified temporal logics in a constructive proof assistant.作者: 易發(fā)怒 時間: 2025-3-30 01:59 作者: Indurate 時間: 2025-3-30 06:12
https://doi.org/10.1007/978-3-658-33877-0hile facilitating property checking. Our approach is based on a higher-order transformation from BPMN models to graph transformation systems. As proof of concept, we have implemented our approach in an open-source web-based tool.作者: GROSS 時間: 2025-3-30 08:34 作者: debacle 時間: 2025-3-30 16:11 作者: 留戀 時間: 2025-3-30 19:39
Formalization and?Analysis of?BPMN Using Graph Transformation Systemshile facilitating property checking. Our approach is based on a higher-order transformation from BPMN models to graph transformation systems. As proof of concept, we have implemented our approach in an open-source web-based tool.作者: 曲解 時間: 2025-3-30 22:15
https://doi.org/10.1007/978-3-662-67108-5, and is applicable to non-linear rules. The method is also defined for other frameworks, including DPO and SqPO, because we have previously shown that they are naturally encodable into PBPO. in the quasitopos setting.作者: 凈禮 時間: 2025-3-31 04:31 作者: Recess 時間: 2025-3-31 08:03 作者: Truculent 時間: 2025-3-31 12:40
