作者: AGGER 時間: 2025-3-21 21:10 作者: Lacerate 時間: 2025-3-22 02:27 作者: 難管 時間: 2025-3-22 05:04 作者: 審問,審訊 時間: 2025-3-22 11:33
Graph Transformation Units Guided by a SAT Solverl to terminal graphs are described by propositional formulas. In this way, it becomes possible to use a SAT solver to find out whether there is a successful derivation for some initial graph or not and how it is built up in the positive case.作者: gain631 時間: 2025-3-22 13:17
Graph Transformation for Domain-Specific Discrete Event Time Simulationr discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches.作者: gain631 時間: 2025-3-22 17:39 作者: 不遵守 時間: 2025-3-22 21:51 作者: FUSE 時間: 2025-3-23 03:11 作者: charisma 時間: 2025-3-23 07:22 作者: 低三下四之人 時間: 2025-3-23 10:58 作者: 不吉祥的女人 時間: 2025-3-23 15:35
Combining Termination Criteria by Isolating Deletion sets of the production rules in the graph transformation system could be verified using different criteria. This paper addresses this problem by providing structural conditions on the rules enabling such combination of termination criteria.作者: 壟斷 時間: 2025-3-23 19:28
Hereditary Pushouts Reconsideredhouts – a twenty year old concept – induce a generalization of adhesive categories, which will be dubbed partial map adhesive. An application relevant category that does not fit the framework of adhesive categories and its variations in the literature will serve as an illustrating example of a partial map adhesive category.作者: Congeal 時間: 2025-3-23 22:20 作者: 使痛苦 時間: 2025-3-24 04:34 作者: ingenue 時間: 2025-3-24 07:01 作者: 考博 時間: 2025-3-24 12:13 作者: 迫擊炮 時間: 2025-3-24 17:46
Saturated LTSs for Adhesive Rewriting Systems approach. Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS. This paper extends the BCs technique in order to derive saturated LTSs for ARSs, applying it to capture bisimilarity for asynchronous calculi.作者: OTTER 時間: 2025-3-24 22:28
Conflict Detection for Model Versioning Based on Graph Modificationsodels as graphs, we define model revisions as graph modifications which are not necessarily rule-based. Building up on the DPO approach to graph transformations, we define two different kinds of conflict detection: (1) the check for operation-based conflicts, and (2) the check for state-based conflicts on results of merged graph modifications.作者: 迅速飛過 時間: 2025-3-24 23:37 作者: canonical 時間: 2025-3-25 04:22 作者: 苦笑 時間: 2025-3-25 10:46
https://doi.org/10.1007/978-981-10-7467-7ri nets and on semilinear sets of markings. Especially we exploit Parikh’s theorem which says that the Parikh image of a context-free grammar is semilinear. An important application is deadlock analysis for interaction nets and we specifically show how to apply the technique to an infinite-state dining philosopher’s system.作者: 隱語 時間: 2025-3-25 13:16 作者: 放牧 時間: 2025-3-25 19:18
How Far Can Enterprise Modeling for Banking Be Supported by Graph Transformation?esents an approach that shows good potential to address security, risk and compliance issues the bank has in its daily business by the use of integrated organizational models build up by enterprise modeling activities. Such organizational models are intended to serve to describe, evaluate, automate,作者: osteoclasts 時間: 2025-3-25 22:16
Graph Transformation Units Guided by a SAT Solveresented by graphs. Given a graph, various rules are applicable at various matches in general, but not any choice leads to a proper result so that one faces the problem of nondeterminism. As countermeasure, graph transformation units provide the generic concept of control conditions which allow one t作者: Anthem 時間: 2025-3-26 01:03
Delaying Constraint Solving in Symbolic Graph Transformationtraints are almost trivial to solve. For instance, this is the case when a rule describes a transformation ., where the attributes of . are obtained by some simple computation from the attributes of .. However there are many other cases where the constraints to solve may be not so trivial and, moreo作者: Missile 時間: 2025-3-26 06:21 作者: 農(nóng)學(xué) 時間: 2025-3-26 09:48
A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixese unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obt作者: 連系 時間: 2025-3-26 13:36 作者: flimsy 時間: 2025-3-26 17:43 作者: Mets552 時間: 2025-3-26 21:13
Saturated LTSs for Adhesive Rewriting Systemsition from . to . is a context .[???] such that .[.] may perform a reaction and reach .. If either all contexts, or just the ”minimal” ones, are considered, the resulting LTS is called saturated (GIPO, respectively). The borrowed contexts (BCs) technique addresses the issue in the setting of the DPO作者: 戰(zhàn)役 時間: 2025-3-27 02:44
A Hoare Calculus for Graph Programspre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules are sound with respect to GP’s operational semantics作者: harangue 時間: 2025-3-27 05:53 作者: MUTE 時間: 2025-3-27 11:00
Conflict Detection for Model Versioning Based on Graph Modificationshnique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems we present an approach which takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of m作者: 朝圣者 時間: 2025-3-27 17:28 作者: Chronological 時間: 2025-3-27 21:04
Graph Rewriting in Span-Categoriesow that all three approaches can be considered special cases of a general rewriting framework in suitable categories of spans over a graph-like base category. From this new view point, it is possible to provide a general and unifying theory for all approaches. We demonstrate this fact by the investi作者: 遺傳學(xué) 時間: 2025-3-27 22:22 作者: craven 時間: 2025-3-28 03:30
Hereditary Pushouts Reconsideredears ago in the category of graphs. Adhesive categories provide a single property of pushouts that suffices to derive lemmas that are essential for central theorems of double pushout rewriting such as the local Church-Rosser Theorem..The present paper shows that the same lemmas already hold for push作者: 鈍劍 時間: 2025-3-28 07:43
Graph Transformation for Domain-Specific Discrete Event Time Simulationtuitive. However, many application domains require an explicit handling of time in order to represent accurately the behaviour of the real system and to obtain useful simulation metrics..Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose 作者: WATER 時間: 2025-3-28 11:50
Counterpart Semantics for a Second-Order ,-Calculus a counterpart relation (a family of partial homomorphisms), allowing for the creation, deletion, and merging of components; and formulas are interpreted over sets of state assignments (families of substitutions, associating formula variables to state components). Our proposal avoids the limitations作者: conduct 時間: 2025-3-28 14:47
Matthias B?hmer,Georges Steffgenon, to the ., a pragmatic technique for palliating the state-explosion problem in automatic verification. While the note provides a very incomplete and hence “false” view of true concurrency, it also includes several pages of references.作者: climax 時間: 2025-3-28 20:08 作者: intimate 時間: 2025-3-28 23:15
Anthony A. Peguero,Jun Sung Hongesented by graphs. Given a graph, various rules are applicable at various matches in general, but not any choice leads to a proper result so that one faces the problem of nondeterminism. As countermeasure, graph transformation units provide the generic concept of control conditions which allow one t作者: 名次后綴 時間: 2025-3-29 05:34
https://doi.org/10.1007/978-3-658-28394-0traints are almost trivial to solve. For instance, this is the case when a rule describes a transformation ., where the attributes of . are obtained by some simple computation from the attributes of .. However there are many other cases where the constraints to solve may be not so trivial and, moreo作者: intertwine 時間: 2025-3-29 07:20
https://doi.org/10.1007/978-1-4302-0848-8led termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs allow one to describe classical data-structures (possibly with pointers) such as doubly-linked lists, circular lists etc. We show how the proposed logic can faithfully describe (i) termgraphs as well as (ii) the作者: Lumbar-Spine 時間: 2025-3-29 12:19 作者: garrulous 時間: 2025-3-29 16:13
https://doi.org/10.1007/978-1-4302-5057-9ch devises an algorithm for constructing a finite complete prefix of the unfolding of a safe Petri net, providing a compact representation of the reachability graph. The extension to contextual nets and graph transformation systems is far from being trivial because events can have multiple causal hi作者: Indicative 時間: 2025-3-29 20:21 作者: Filibuster 時間: 2025-3-30 00:38 作者: Externalize 時間: 2025-3-30 04:09
https://doi.org/10.1007/978-3-030-02391-1pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules are sound with respect to GP’s operational semantics作者: 植物茂盛 時間: 2025-3-30 11:18 作者: 陶醉 時間: 2025-3-30 14:14 作者: kindred 時間: 2025-3-30 17:32
https://doi.org/10.1007/978-3-7643-8323-7ual language engineering. Termination is one of the ingredients of functional behaviour and thus equally important. However, the termination of graph transformation systems is generally undecidable. Hence, most of the published termination criteria focus on specific classes of graph transformations.作者: Impugn 時間: 2025-3-30 20:59
https://doi.org/10.1007/978-3-658-00197-1ow that all three approaches can be considered special cases of a general rewriting framework in suitable categories of spans over a graph-like base category. From this new view point, it is possible to provide a general and unifying theory for all approaches. We demonstrate this fact by the investi作者: ABASH 時間: 2025-3-31 03:46
https://doi.org/10.1007/978-0-387-68192-4h-level replacement (HLR) category. We call an object finite if it has a finite number of .-subobjects. In this paper, we show that in finitary .-adhesive categories we do not only have all the well-known properties of .-adhesive categories, but also all the additional HLR-requirements which are nee作者: 針葉 時間: 2025-3-31 05:44 作者: 分開如此和諧 時間: 2025-3-31 11:41
https://doi.org/10.1007/978-3-322-82357-1tuitive. However, many application domains require an explicit handling of time in order to represent accurately the behaviour of the real system and to obtain useful simulation metrics..Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose 作者: 心神不寧 時間: 2025-3-31 16:51 作者: Benzodiazepines 時間: 2025-3-31 17:46 作者: 豐滿有漂亮 時間: 2025-4-1 01:42
Matthias B?hmer,Georges Steffgenon, to the ., a pragmatic technique for palliating the state-explosion problem in automatic verification. While the note provides a very incomplete and hence “false” view of true concurrency, it also includes several pages of references.作者: 誘拐 時間: 2025-4-1 05:18 作者: 執(zhí) 時間: 2025-4-1 08:27
https://doi.org/10.1007/978-3-030-02391-1pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules are sound with respect to GP’s operational semantics.作者: 細(xì)絲 時間: 2025-4-1 10:32
A False History of True Concurrency: From Petri to Toolson, to the ., a pragmatic technique for palliating the state-explosion problem in automatic verification. While the note provides a very incomplete and hence “false” view of true concurrency, it also includes several pages of references.作者: 可互換 時間: 2025-4-1 15:19
A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixese unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.
