作者: 吝嗇性 時(shí)間: 2025-3-21 22:59
Completeness-Driven Developmentss measures, CDD ensures that the next step in the design process can only be entered if completeness at the current abstraction level has been achieved. This leads to an early detection of bugs and accelerates the whole design process. The application of CDD is illustrated by means of an example.作者: Mediocre 時(shí)間: 2025-3-22 01:12 作者: 顯赫的人 時(shí)間: 2025-3-22 06:30
Toward Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammarsnts. We further show that the main decomposition and composition result, which is the formal basis for correctness, completeness, consistency, and functional behavior, holds analogous to the classical approach and demonstrate that classical triple graph transformation is actually a special case – af作者: 抱狗不敢前 時(shí)間: 2025-3-22 11:37
Towards Automatic Verification of Behavior Preservation for Model Transformation via Invariant Checkhis paper, we present a first approach towards automatic behavior preservation verification for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invar作者: nautical 時(shí)間: 2025-3-22 13:08 作者: nautical 時(shí)間: 2025-3-22 19:27
https://doi.org/10.1007/978-1-4615-0225-8ss measures, CDD ensures that the next step in the design process can only be entered if completeness at the current abstraction level has been achieved. This leads to an early detection of bugs and accelerates the whole design process. The application of CDD is illustrated by means of an example.作者: 紅潤(rùn) 時(shí)間: 2025-3-22 22:52
https://doi.org/10.1007/978-0-387-71058-7ture for GTSs. We also propose a type system to denote part of the formulae as either reflected or preserved, together with a technique that exploits under- and over-approximations to reason about typed as well as untyped formulae.作者: Formidable 時(shí)間: 2025-3-23 03:58
Manuel Duque-Antón,Otto Mildenbergernts. We further show that the main decomposition and composition result, which is the formal basis for correctness, completeness, consistency, and functional behavior, holds analogous to the classical approach and demonstrate that classical triple graph transformation is actually a special case – af作者: 能得到 時(shí)間: 2025-3-23 05:50
https://doi.org/10.1007/978-981-10-3099-4his paper, we present a first approach towards automatic behavior preservation verification for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invar作者: 得罪 時(shí)間: 2025-3-23 19:45 作者: FACT 時(shí)間: 2025-3-23 23:46
Exploiting Over- and Under-Approximations for Infinite-State Counterpart Modelsewrite rules that allow an unbounded creation of items. For such systems, verification can become intractable, thus calling for the development of approximation techniques that may ease the verification at the cost of losing in preciseness and completeness. Both over- and under-approximations have b作者: narcissism 時(shí)間: 2025-3-24 04:09
Pattern-Based Graph Abstractionimple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into ., layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern graphs are then abstracted to a finite universe of . by collapsing equival作者: 邪惡的你 時(shí)間: 2025-3-24 10:02 作者: Working-Memory 時(shí)間: 2025-3-24 11:27
Parallelism and Concurrency of Stochastic Graph Transformationse described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Pa作者: 螢火蟲 時(shí)間: 2025-3-24 17:55
Refined Graph Rewriting in Span-Categories (SqPO). In this paper, we present a framework that generalises all three approaches. The central issue is a gluing construction, which is a generalisation of the construction introduced in [14]. It has pushout-like properties wrt. composition . decomposition, which allow to reestablish major parts 作者: heterogeneous 時(shí)間: 2025-3-24 20:03 作者: 協(xié)迫 時(shí)間: 2025-3-25 00:23
Toward Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammarsith their correspondences. The classical theoretical model of triple graphs is based on a morphism span from the correspondence component to the source and target components. In practice, this formalization often can not be used as for certain applications no proper morphisms between the corresponde作者: 最高點(diǎn) 時(shí)間: 2025-3-25 04:05
Graph Transformation with Focus on Incident Edgesode may be cloned together with either all its incident edges or with only its outgoing edges or with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. We first d作者: embolus 時(shí)間: 2025-3-25 08:04
Rational Term Rewriting Revisited: Decidability and Confluencee number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.作者: 制定法律 時(shí)間: 2025-3-25 12:12
A General Attribution Concept for Models in ,-Adhesive Transformation Systems kinds of models used in .-adhesive transformation systems, which are a special kind of graph transformation system based on .-adhesive categories. Especially a proper representation and definition of attributes and their values as well as a suitable handling of the data does not fit well with other作者: 難解 時(shí)間: 2025-3-25 16:14
DPO Transformation with Open Mapsng the graph structure. However, there are situations where occurrences are bound by additional constraints. These can either be implicit, such as the gluing conditions of the DPO, or explicit such as negative application conditions..In this paper we study another type of implicit condition based on作者: 編輯才信任 時(shí)間: 2025-3-25 20:10
-Adhesive Transformation Systemsral for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise .-adhesive transformation systems to .-adhesive transformation systems, where . is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the作者: 單挑 時(shí)間: 2025-3-26 02:13
Generalised Compositionality in Graph Transformationper generalises a previous result in two different ways. Firstly, rules do not have to form pullbacks with their interfaces; this enables graph passing between components, meaning that components may “l(fā)earn” and “forget” subgraphs through communication with other components. Secondly, composition is作者: milligram 時(shí)間: 2025-3-26 05:52 作者: Cantankerous 時(shí)間: 2025-3-26 12:17
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checkingd for invariant checking in graph transformation systems. Since earlier related work on graph automata suffered from the explosion of the size of the automata and the need of approximations due to the non-determinism of the automata, we here employ symbolic .-based techniques and recent antichain al作者: insomnia 時(shí)間: 2025-3-26 13:51 作者: Engulf 時(shí)間: 2025-3-26 17:13 作者: CRUE 時(shí)間: 2025-3-26 23:28 作者: 安心地散步 時(shí)間: 2025-3-27 04:52
https://doi.org/10.1007/978-1-4615-0225-8vels have been added to the conventional design flow resulting in . (ESL) design. Besides abstraction, the focus in ESL during the development of a system moves from design to verification, i.e.?checking whether or not the system works as intended becomes more and more important. However, at each ab作者: Ambulatory 時(shí)間: 2025-3-27 07:16
https://doi.org/10.1007/978-0-387-71058-7ewrite rules that allow an unbounded creation of items. For such systems, verification can become intractable, thus calling for the development of approximation techniques that may ease the verification at the cost of losing in preciseness and completeness. Both over- and under-approximations have b作者: syring 時(shí)間: 2025-3-27 09:47
Mobile und drahtlose Informationssystemeimple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into ., layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern graphs are then abstracted to a finite universe of . by collapsing equival作者: wreathe 時(shí)間: 2025-3-27 17:20
https://doi.org/10.1007/978-3-531-90099-5 larger than some given state. For graphs, a typical such partial order is the minor ordering, which allows to specify “bad graphs” as those graphs having a given graph as a minor. Well-structuredness of the transition system enables a finite representation of upward-closed sets and gives rise to a 作者: packet 時(shí)間: 2025-3-27 20:47 作者: 怎樣才咆哮 時(shí)間: 2025-3-28 01:37
https://doi.org/10.1007/978-3-322-83660-1 (SqPO). In this paper, we present a framework that generalises all three approaches. The central issue is a gluing construction, which is a generalisation of the construction introduced in [14]. It has pushout-like properties wrt. composition . decomposition, which allow to reestablish major parts 作者: Exonerate 時(shí)間: 2025-3-28 03:01 作者: exorbitant 時(shí)間: 2025-3-28 08:08
Manuel Duque-Antón,Otto Mildenbergerith their correspondences. The classical theoretical model of triple graphs is based on a morphism span from the correspondence component to the source and target components. In practice, this formalization often can not be used as for certain applications no proper morphisms between the corresponde作者: 無(wú)情 時(shí)間: 2025-3-28 13:09
Reinhold Eberhardt,Walter Franzode may be cloned together with either all its incident edges or with only its outgoing edges or with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. We first d作者: dandruff 時(shí)間: 2025-3-28 16:10 作者: 情感 時(shí)間: 2025-3-28 22:10
https://doi.org/10.1007/978-3-540-92225-4 kinds of models used in .-adhesive transformation systems, which are a special kind of graph transformation system based on .-adhesive categories. Especially a proper representation and definition of attributes and their values as well as a suitable handling of the data does not fit well with other作者: Confidential 時(shí)間: 2025-3-29 01:43
https://doi.org/10.1057/9781137003638ng the graph structure. However, there are situations where occurrences are bound by additional constraints. These can either be implicit, such as the gluing conditions of the DPO, or explicit such as negative application conditions..In this paper we study another type of implicit condition based on作者: 和平主義 時(shí)間: 2025-3-29 06:41 作者: 嬉耍 時(shí)間: 2025-3-29 08:54 作者: 事情 時(shí)間: 2025-3-29 12:05
https://doi.org/10.1007/978-981-10-3099-4ion is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of bisimulatio作者: fleeting 時(shí)間: 2025-3-29 17:45 作者: Basal-Ganglia 時(shí)間: 2025-3-29 20:59
https://doi.org/10.1007/b117511tions being tested. Structural coverage criteria, traditionally used to assess test suites, require access to code. As an alternative we consider model-based criteria based on interface specifications using visual contracts..Formally represented as graph transformation rules, visual contracts are an作者: 萬(wàn)神殿 時(shí)間: 2025-3-30 02:28
Parallelism and Concurrency of Stochastic Graph Transformationsored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Parallelism and Concurrency Theorems and their application to computing the completion time of a concurrent process.作者: Interregnum 時(shí)間: 2025-3-30 07:04 作者: 可憎 時(shí)間: 2025-3-30 11:32
Generalised Compositionality in Graph Transformationg between components, meaning that components may “l(fā)earn” and “forget” subgraphs through communication with other components. Secondly, composition is no longer binary; instead, it can be repeated for an arbitrary number of components.作者: narcotic 時(shí)間: 2025-3-30 16:15 作者: Demonstrate 時(shí)間: 2025-3-30 19:59
Francesco Vatalaro,Fulvio Ananassork supports both behaviour and quality-of-service constraints for the discovery, ranking and selection of external services. Service instantiation and binding are captured as algebraic operations on configuration graphs.作者: RECUR 時(shí)間: 2025-3-30 22:39
Mobile und drahtlose Informationssystemeent patterns. This paper shows how the application of production rules can be lifted to pattern shapes, resulting in an over-approximation of the original system behaviour and thus enabling verification on the abstract level.作者: GULLY 時(shí)間: 2025-3-31 04:15
A Graph-Based Design Framework for Servicesrk supports both behaviour and quality-of-service constraints for the discovery, ranking and selection of external services. Service instantiation and binding are captured as algebraic operations on configuration graphs.作者: 出沒(méi) 時(shí)間: 2025-3-31 07:15 作者: VERT 時(shí)間: 2025-3-31 09:29 作者: 合并 時(shí)間: 2025-3-31 15:42 作者: 食物 時(shí)間: 2025-3-31 20:30 作者: 伴隨而來(lái) 時(shí)間: 2025-3-31 22:09
Abhay Karandikar,Nadeem Akhtar,Mahima Mehtaautomata and the need of approximations due to the non-determinism of the automata, we here employ symbolic .-based techniques and recent antichain algorithms for language inclusion to overcome these issues. We have implemented techniques for generating, manipulating and analyzing graph automata and perform an experimental evaluation.作者: 死亡 時(shí)間: 2025-4-1 04:41 作者: craving 時(shí)間: 2025-4-1 07:44 作者: Ebct207 時(shí)間: 2025-4-1 12:38 作者: Cloudburst 時(shí)間: 2025-4-1 18:16
https://doi.org/10.1057/9781137003638oyal, Nielsen, and Winskel. We show that under certain restrictions on the rules, DPOs preserve open maps. We establish an encoding of open maps into negative application conditions and study concurrency properties of the new approach.作者: paroxysm 時(shí)間: 2025-4-1 19:32
Kathy Burrell,Kathrin H?rschelmannms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of .-adhesive systems.作者: 未開(kāi)化 時(shí)間: 2025-4-1 22:48
Well-Structured Graph Transformation Systems with Negative Application Conditionsructured transition systems (WSTS) if the minor ordering is used and certain condition on the rules are satisfied. We study graph transformation systems with negative application conditions and show under which conditions they are well-structured and are hence amenable to a backwards search decision procedure for checking coverability.作者: 兇殘 時(shí)間: 2025-4-2 03:33
Graph Transformation with Focus on Incident Edgesloned. For this purpose, we introduce the notion of polarized graphs as graphs endowed with some annotations on nodes and we define graph transformations with polarized node cloning by means of sesqui-pushouts in the category of polarized graphs.作者: 無(wú)思維能力 時(shí)間: 2025-4-2 09:48
