作者: 大吃大喝 時間: 2025-3-21 20:39
https://doi.org/10.1007/978-3-658-15046-4le and construct NACs based on this kernel. Then we give sufficient conditions such that source consistency implies NAC consistency and termination. Moreover, we analyse how to achieve local confluence independent of source consistency. Both results together provide sufficient conditions for functio作者: CHOKE 時間: 2025-3-22 02:33 作者: 生意行為 時間: 2025-3-22 06:14 作者: 背景 時間: 2025-3-22 10:16 作者: Recess 時間: 2025-3-22 14:12 作者: Recess 時間: 2025-3-22 20:28 作者: LAPSE 時間: 2025-3-23 00:42 作者: glacial 時間: 2025-3-23 03:29 作者: 粗糙 時間: 2025-3-23 06:22
Attributed Graph Constraintsng the straightforward generalization of standard graph constraints, there is no obvious way of stating properties about the attributes of the given graphs..In this paper we introduce a new formulation for attributed graph constraints. More precisely, the idea is to see these constraints as standard作者: chemoprevention 時間: 2025-3-23 13:20 作者: fiscal 時間: 2025-3-23 13:56
https://doi.org/10.1007/978-3-322-90464-5 attractive as information systems become more “process-aware”. Unfortunately, the classical Petri net has problems modeling cancellation in a succinct and direct manner. Modeling cancellation regions in a classical net is impossible or results in a “spaghetti-like” net. Cancellation regions are sup作者: 推崇 時間: 2025-3-23 20:46
https://doi.org/10.1007/978-3-642-18730-8between vehicle platforms, between electronic networks, and between individual electronic control units (ECUs). To enable the exchange an abstraction layer – the AUTOSAR runtime environment (RTE) – has been defined as a set of services provided to applications. Typical services are communication via作者: dagger 時間: 2025-3-24 01:01
https://doi.org/10.1007/978-1-4684-1526-1essfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a de作者: aesthetic 時間: 2025-3-24 03:25
roduced and studied by Mazurkiewicz [17,18]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations. Then for these models, we give complete characterisations of labelled graphs in which the naming problem can be solved. Our characte作者: reception 時間: 2025-3-24 09:37
https://doi.org/10.1007/978-3-322-99269-7c data structures. The aim of our framework is to extend finite-state verification techniques to handle pointer-manipulating programs operating on complex dynamic data structures that are potentially unbounded in their size. The idea is to represent both abstraction mappings on user-defined dynamic 作者: lymphoma 時間: 2025-3-24 10:40 作者: 線 時間: 2025-3-24 18:46 作者: Allowance 時間: 2025-3-24 22:24
https://doi.org/10.1007/978-1-4615-5055-6aphs and it is sound and complete with respect to the structural congruence of the calculus (that is, two processes are equivalent iff they are mapped into isomorphic graphs). With respect to alternative proposals for the graphical implementation of mobile ambients, our encoding distinguishes the sy作者: 修飾 時間: 2025-3-25 01:13 作者: Calibrate 時間: 2025-3-25 04:06
https://doi.org/10.1007/978-0-85729-625-2 modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of objects in computer graphics, especially for simulation of complex structured systems where rearrangements of compartments are subject to change. We also defin作者: HIKE 時間: 2025-3-25 11:09 作者: Palpable 時間: 2025-3-25 12:28
https://doi.org/10.1007/978-3-658-15046-4raph. The corresponding rules also contain these parts and describe the simultaneous construction of both the source and the target model. From these rules, forward rules can be derived which describe the model transformation from a given source model to a target model. The forward transformation mu作者: 慢慢啃 時間: 2025-3-25 18:55 作者: poliosis 時間: 2025-3-25 22:52
https://doi.org/10.1057/9781137316028program, but they cannot describe the relationship between the input and the output of a program derivation. Therefore, we investigate program conditions, a generalized type of conditions expressing properties on program derivations. Program conditions look like nested rules with application conditi作者: refine 時間: 2025-3-26 01:34
Mobile Forensics – The File Format Handbook far those same notions were missing for . rewriting extended with borrowed contexts (.), a formalism used for equipping . derivations with labels and introduced for modeling open systems that interact with the environment..In this work we propose the definition of parallel and sequential independen作者: 鞭打 時間: 2025-3-26 07:20 作者: 可用 時間: 2025-3-26 09:44
James M. Rehg,Susan A. Murphy,Santosh Kumaror a refined notion of interface. The interface towards the external environment of a ranked open net is given by a subset of places designated as open and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the n作者: inspired 時間: 2025-3-26 13:45 作者: 比目魚 時間: 2025-3-26 16:57
Towards an Algebraic Theory of Bidirectional Transformationsearly work on an algebraic presentation of bidirectional transformations. In general, a bidirectional transformation must maintain consistency between two models, either of which may be edited, and each of which may incorporate information not represented in the other. Our main focus here is on lens作者: 盲信者 時間: 2025-3-26 23:55
Discovery, Verification and Conformance of Workflows with Cancellation attractive as information systems become more “process-aware”. Unfortunately, the classical Petri net has problems modeling cancellation in a succinct and direct manner. Modeling cancellation regions in a classical net is impossible or results in a “spaghetti-like” net. Cancellation regions are sup作者: coalition 時間: 2025-3-27 01:24
The AUTOSAR Way of Model-Based Engineering of Automotive Systemsbetween vehicle platforms, between electronic networks, and between individual electronic control units (ECUs). To enable the exchange an abstraction layer – the AUTOSAR runtime environment (RTE) – has been defined as a set of services provided to applications. Typical services are communication via作者: 勛章 時間: 2025-3-27 09:21
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammarsessfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a de作者: 狂亂 時間: 2025-3-27 13:17
Labelled (Hyper)Graphs, Negotiations and the Naming Problemroduced and studied by Mazurkiewicz [17,18]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations. Then for these models, we give complete characterisations of labelled graphs in which the naming problem can be solved. Our characte作者: Restenosis 時間: 2025-3-27 17:32
Abstracting Complex Data Structures by Hyperedge Replacementc data structures. The aim of our framework is to extend finite-state verification techniques to handle pointer-manipulating programs operating on complex dynamic data structures that are potentially unbounded in their size. The idea is to represent both abstraction mappings on user-defined dynamic 作者: 遺忘 時間: 2025-3-27 18:05
Inductively Sequential Term-Graph Rewrite Systems In this paper, we consider the use of definitional trees in the context of term-graph rewriting. We show that, unlike the case of term rewrite systems, the strategies induced by definitional trees do not always compute needed redexes, in presence of term-graph rewrite systems. We then define a new 作者: 戲服 時間: 2025-3-27 23:36 作者: irreducible 時間: 2025-3-28 02:05
A Decentralized Implementation of Mobile Ambientsaphs and it is sound and complete with respect to the structural congruence of the calculus (that is, two processes are equivalent iff they are mapped into isomorphic graphs). With respect to alternative proposals for the graphical implementation of mobile ambients, our encoding distinguishes the sy作者: 血友病 時間: 2025-3-28 08:12
Network Applications of Graph Bisimulationng graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph composition and node restriction. We use this notion of equivalence to study some sample network applications, and show that our bisimulation equivalence captures notions like functional 作者: HACK 時間: 2025-3-28 13:53 作者: Host142 時間: 2025-3-28 15:33
Embedding and Confluence of Graph Transformations with Negative Application Conditionsive application conditions (NACs). These conditions restrict the application of a rule by expressing that a specific structure must not be present before or after applying the rule to a certain context. Such a condition influences each rule application and transformation and therefore changes signif作者: 名義上 時間: 2025-3-28 21:57 作者: cardiovascular 時間: 2025-3-29 02:28
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformationimulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have ., if for each simulation run of the target system we find a corresponding simulation run in the source system..In our framework of graph transformation, models are given by graphs, a作者: 冰雹 時間: 2025-3-29 05:19 作者: 忘川河 時間: 2025-3-29 09:00 作者: 治愈 時間: 2025-3-29 13:38
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contextsost common approaches to behavior preservation rely basically on checking given models and their refactored versions. In this paper we introduce a more general technique for checking behavior preservation of refactorings defined by graph transformation rules. We use double pushout (DPO) rewriting wi作者: In-Situ 時間: 2025-3-29 17:12
Open Petri Nets: Non-deterministic Processes and Compositionalityor a refined notion of interface. The interface towards the external environment of a ranked open net is given by a subset of places designated as open and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the n作者: 舊病復(fù)發(fā) 時間: 2025-3-29 22:38 作者: Isometric 時間: 2025-3-30 00:23
https://doi.org/10.1007/978-1-4684-1526-1e. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a derivation. The resulting algorithm is reasonably efficient and can be directly used, among other things, for auto-completion in the context of diagram editors.作者: commute 時間: 2025-3-30 05:55 作者: 有限 時間: 2025-3-30 08:52
https://doi.org/10.1007/978-3-662-67413-0aper we show how to use mobile agents as an alternative model for implementing distributed local computation rules. In doing so, we approach a general and unified framework for local computations which is consistent with the classical theory of distributed computations based on graph relabeling systems.作者: Preserve 時間: 2025-3-30 12:29 作者: Latency 時間: 2025-3-30 19:54
https://doi.org/10.1007/978-0-85729-625-2n computer graphics, especially for simulation of complex structured systems where rearrangements of compartments are subject to change. We also define application of such meta-rules and prove that it preserves some necessary conditions for G-maps.作者: 串通 時間: 2025-3-30 23:17
James M. Rehg,Susan A. Murphy,Santosh Kumarn and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the non-deterministic process semantics is compositional with respect to the composition operation over ranked open nets, a result which did not hold for basic open nets.作者: 收集 時間: 2025-3-31 03:57 作者: 奴才 時間: 2025-3-31 06:44 作者: optic-nerve 時間: 2025-3-31 10:35
Discovery, Verification and Conformance of Workflows with Cancellation such models), (2) the . of RWF-nets (i.e., checking whether a workflow process has deadlocks, livelocks, etc.), and (3) the . of an event log with respect to a RWF-net (i.e., comparing real with modeled behavior).作者: Gentry 時間: 2025-3-31 14:12
Embedding and Confluence of Graph Transformations with Negative Application Conditionss hold for adhesive high-level replacement systems with NACs and are formulated in this paper for the instantiation to double-pushout graph transformation systems with NACs. All constructions and results are explained on a running example.
