Host142
发表于 2025-3-28 15:33:32
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:09
http://reply.papertrans.cn/39/3880/387976/387976_42.png
cardiovascular
发表于 2025-3-29 02:28:12
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:31
http://reply.papertrans.cn/39/3880/387976/387976_44.png
忘川河
发表于 2025-3-29 09:00:40
http://reply.papertrans.cn/39/3880/387976/387976_45.png
治愈
发表于 2025-3-29 13:38:45
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:33
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
旧病复发
发表于 2025-3-29 22:38:36
http://reply.papertrans.cn/39/3880/387976/387976_48.png
Isometric
发表于 2025-3-30 00:23:20
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:18
http://reply.papertrans.cn/39/3880/387976/387976_50.png