作者: Salivary-Gland 時間: 2025-3-21 20:58 作者: Deject 時間: 2025-3-22 02:36 作者: 細胞 時間: 2025-3-22 05:34 作者: 實施生效 時間: 2025-3-22 12:41
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcsg case study concerning travel agencies. This study deals with the organisation of processes that are constantly suspended by others. The main focus of the case study is to investigate the possibilities of small and medium travel agencies to provide a continuous service for their customers while tra作者: Harpoon 時間: 2025-3-22 13:05 作者: Harpoon 時間: 2025-3-22 18:03 作者: OTTER 時間: 2025-3-22 23:01
Using Graph Transformations for Formalizing Prescriptions and Monitoring Adherenceplex and variable prescriptions to be semantically coded and their adherence to be automatically monitored. Our work has been implemented within a prototypical prescribing tool and validated with domain experts.作者: Accolade 時間: 2025-3-23 03:52
https://doi.org/10.1007/978-3-642-99731-0ry for rule composition and decomposition is elaborated on an abstract categorical level. The results are applied to model rule extension and type dependent rule application. This extension mechanism qualifies SqPO – with its very useful copy mechanism for unknown contexts – as a modelling technique作者: Exuberance 時間: 2025-3-23 05:39 作者: 技術(shù) 時間: 2025-3-23 13:12
Mitteilungen über Forschungsarbeitenections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical alge作者: 固執(zhí)點好 時間: 2025-3-23 15:16 作者: MONY 時間: 2025-3-23 19:35 作者: Heterodoxy 時間: 2025-3-24 00:42
https://doi.org/10.1007/978-3-662-02161-3ously and are operationalized automatically to forward and backward rules describing single transformation steps in the respective direction. These operational rules, however, are of fixed size and cannot describe transformation steps whose size can only be determined at transformation time for conc作者: Resistance 時間: 2025-3-24 03:44 作者: 詼諧 時間: 2025-3-24 08:42
https://doi.org/10.1007/978-3-662-01983-2he depth of derivations and the cutwidth of the source graph. More precisely, we show that for any set . of graph transformation rules, one can determine in time . whether a graph . of cutwidth . can be transformed into a graph . in depth at most . by the application of graph transformation rules fr作者: Minikin 時間: 2025-3-24 13:24
https://doi.org/10.1007/978-3-662-42507-7ms, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we define a class of context-free grammars, called B-ESG g作者: CHAR 時間: 2025-3-24 18:41
https://doi.org/10.1007/978-3-662-02006-7This approach is purely declarative in the sense that instance construction is not incorporated but has to added. In contrast, graph grammars incorporate the stepwise construction of instances by applying transformation rules. Establishing a formal relation between meta-modeling and graph transforma作者: 微塵 時間: 2025-3-24 21:51
https://doi.org/10.1007/978-3-662-02217-7d models such as graph transformation systems, model evolution may be represented by means of a collection of structural modifications in individual transformation rules. In this work we introduce the notion of inter-level conflict between rule modification and rule application, characterizing the s作者: 有說服力 時間: 2025-3-25 01:07
https://doi.org/10.1007/978-3-662-02060-9mbedded DSLs. This paper introduces FunnyQT’s embedded graph pattern matching DSL which allows users to define patterns using a convenient textual notation that can be applied to graphs. The result of applying a pattern to a graph is the lazy sequence of all matches of the pattern in the graph. Funn作者: 贊成你 時間: 2025-3-25 06:27 作者: 內(nèi)疚 時間: 2025-3-25 07:32 作者: 禁令 時間: 2025-3-25 14:44 作者: IVORY 時間: 2025-3-25 17:07
https://doi.org/10.1007/978-3-662-01997-9lar to a . loop for graph transformation rules by consolidating multiple applications of rules depending on how many rule applications are available at transformation time. TGGs are a well-known technique used to specify bidirectional model transformation, where consistency is described via triple r作者: 助記 時間: 2025-3-25 20:40
Polymorphic Sesqui-Pushout Graph Rewritingry for rule composition and decomposition is elaborated on an abstract categorical level. The results are applied to model rule extension and type dependent rule application. This extension mechanism qualifies SqPO – with its very useful copy mechanism for unknown contexts – as a modelling technique作者: 狼群 時間: 2025-3-26 01:04 作者: NOVA 時間: 2025-3-26 04:51
AGREE – Algebraic Graph Rewriting with Controlled Embeddingections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical alge作者: FOVEA 時間: 2025-3-26 11:03
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semiringsralize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In?this way we obtain a framework which includes the tropical and arctic type graphs of [.] and a new variant of arithmetic type graphs. These type graphs can be used to assi作者: Melatonin 時間: 2025-3-26 12:51 作者: 拋媚眼 時間: 2025-3-26 17:26 作者: follicle 時間: 2025-3-26 23:26 作者: 無表情 時間: 2025-3-27 04:25 作者: Bumble 時間: 2025-3-27 07:33 作者: 小平面 時間: 2025-3-27 13:17 作者: 人類 時間: 2025-3-27 17:14
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systemsd models such as graph transformation systems, model evolution may be represented by means of a collection of structural modifications in individual transformation rules. In this work we introduce the notion of inter-level conflict between rule modification and rule application, characterizing the s作者: 得意人 時間: 2025-3-27 21:32
Graph Pattern Matching as an Embedded Clojure DSLmbedded DSLs. This paper introduces FunnyQT’s embedded graph pattern matching DSL which allows users to define patterns using a convenient textual notation that can be applied to graphs. The result of applying a pattern to a graph is the lazy sequence of all matches of the pattern in the graph. Funn作者: 有花 時間: 2025-3-28 00:23
Using Graph Transformations for Formalizing Prescriptions and Monitoring Adherence’s condition and the prescribed substance(s). In today’s IT supported clinical environments, prescriptions are often authored electronically. Patient adherence to the prescribed medication regimen is a key determinant for the outcome of the intervention. Recently, an increasing number of information作者: 旋轉(zhuǎn)一周 時間: 2025-3-28 05:58
Towards Compliance Verification Between Global and Local Process Models compliance with the globally specified rules of that collaboration. We assume that the collaborative workflow is specified as a BPMN Collaboration Diagram and the local workflows as BPMN Process Diagrams. We then employ existing LTL semantics of the former and token semantics of the latter to verif作者: jagged 時間: 2025-3-28 06:49
Inductive Invariant Checking with Partial Negative Application Conditions this expressive power comes at the cost of rather limited automated analysis capabilities. The general case of unbounded many initial graphs or infinite state spaces is only supported by approaches with rather limited scalability or expressiveness. In this paper we improve an existing approach for 作者: VEIL 時間: 2025-3-28 12:04
Tool Support for Multi-amalgamated Triple Graph Grammarslar to a . loop for graph transformation rules by consolidating multiple applications of rules depending on how many rule applications are available at transformation time. TGGs are a well-known technique used to specify bidirectional model transformation, where consistency is described via triple r作者: 摘要 時間: 2025-3-28 17:16 作者: Amendment 時間: 2025-3-28 19:04
https://doi.org/10.1007/978-3-662-42507-7B-ESG rewrite patterns. We also show that it is possible to reason at the level of grammars by providing a simple method for transforming a grammar by string graph rewriting, and showing admissibility of the induced B-ESG rewrite pattern.作者: Perceive 時間: 2025-3-29 00:29 作者: Intact 時間: 2025-3-29 05:55
Multi-amalgamated Triple Graph Grammarson of multiple transformations sharing a common subpart to a single transformation. For TGGs, this enables repeating certain parts of a forward or backward transformation step in a . loop-like manner depending on concrete models at transformation time.作者: catagen 時間: 2025-3-29 09:38
Equational Reasoning with Context-Free Families of String DiagramsB-ESG rewrite patterns. We also show that it is possible to reason at the level of grammars by providing a simple method for transforming a grammar by string graph rewriting, and showing admissibility of the induced B-ESG rewrite pattern.作者: cinder 時間: 2025-3-29 14:52
Inductive Invariant Checking with Partial Negative Application ConditionsWe also substantially extend the expressive power by supporting more complex negative application conditions and provide higher accuracy by employing advanced implication checks. The improvements are evaluated and compared with another applicable tool by considering three case studies.作者: 影響帶來 時間: 2025-3-29 18:35
Predictive Top-Down Parsing for Hyperedge Replacement Grammarsnonterminals, in analogy to the first and follow symbols used in SLL(1) parsing. The analysis checks whether a grammar is PTD parsable and yields all information for generating a parser that runs in linear space and quadratic time.作者: formula 時間: 2025-3-29 21:47 作者: 首創(chuàng)精神 時間: 2025-3-30 03:33 作者: OVERT 時間: 2025-3-30 06:04 作者: mendacity 時間: 2025-3-30 11:19
https://doi.org/10.1007/978-3-662-01993-1gn weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez.作者: amphibian 時間: 2025-3-30 13:08
https://doi.org/10.1007/978-3-662-02217-7ituations where the evolution disables a transition of the original system. We discuss the confluence of the evolution with respect to individual rewritings, and we also propose how the notion of inter-level conflict can be used to help the modeler to foresee the effects of model evolution.作者: 未開化 時間: 2025-3-30 18:03 作者: artless 時間: 2025-3-30 23:38 作者: absolve 時間: 2025-3-31 03:58
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systemsituations where the evolution disables a transition of the original system. We discuss the confluence of the evolution with respect to individual rewritings, and we also propose how the notion of inter-level conflict can be used to help the modeler to foresee the effects of model evolution.作者: 卡死偷電 時間: 2025-3-31 09:00
https://doi.org/10.1007/978-3-476-03299-7nonterminals, in analogy to the first and follow symbols used in SLL(1) parsing. The analysis checks whether a grammar is PTD parsable and yields all information for generating a parser that runs in linear space and quadratic time.作者: 流浪 時間: 2025-3-31 12:44
Mitteilungen über Forschungsarbeitenwhen cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical algebraic approaches to graph transformation, for the case of monic matches, where rules allow one to specify how the embedding of preserved items should be carried out.
