Towards a Distributed Modeling Process Based on Composite Models

Strüber, Daniel; Taentzer, Gabriele; Jurack, Stefan; Schäfer, Tim

doi:10.1007/978-3-642-37057-1_2

Cited by 14 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Providing an efficient solution for the matching of base rules represented as disconnected graphs is also subject for possible future work, as is to compare our approach against existing algorithms aiming at specific tasks in compilers and theorem provers. Finally, we aim to apply variabilitybased rules to distributed modeling scenarios with multiple variants of editing steps, e.g., synchronous and asynchronous ones [21]. Fig.…”

Section: Resultsmentioning

confidence: 99%

A Variability-Based Approach to Reusable and Efficient Model Transformations

Strüber

Rubin

Chećhik

et al. 2015

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Large model transformation systems often contain transformation rules that are substantially similar to each other, causing performance bottlenecks for systems in which rules are applied nondeterministically, as long as one of them is applicable. We tackle this problem by introducing variability-based graph transformations. We formally define variability-based rules and contribute a novel match-finding algorithm for applying them. We prove correctness of our approach by showing its equivalence to the classic one of applying the rules individually, and demonstrate the achieved performance speed-up on a realistic transformation scenario.

show abstract

Section: Resultsmentioning

confidence: 99%

A Variability-Based Approach to Reusable and Efficient Model Transformations

Strüber

Rubin

Chećhik

et al. 2015

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…A concern of future work is not only to derive a set of sub-models, but also explicit export and import interfaces for the sub-models. The tool could then be integrated into the distributed modeling process proposed in [3]. Furthermore, splitting of model instances along the meta-model decomposition is to be investigated.…”

Section: Resultsmentioning

confidence: 99%

“…However, a configurable and useroriented graph clustering tool has not been invested yet. Preliminary work on the subject of model splitting has been done in the context of a distributed modeling process [3]. While this former contribution provides a formalization for the result of splitting a model into a set of components, it does not describe a method of automation.…”

Section: Introductionmentioning

confidence: 99%

Tool support for clustering large meta-models

Strüber

Selter

Taentzer

2013

Proceedings of the Workshop on Scalability in Model Driven Engineering

Self Cite

View full text Add to dashboard Cite

Ever-growing requirements, long-term evolution and modernization of software projects lead to meta-models of remarkable size, being difficult to comprehend and maintain. This paper presents a tool that supports the decomposition of a meta-model into clusters of model elements. Methods proposed in the research area of graph clustering, aiming at the desired properties of high cohesion and low coupling, have been integrated in the tool. The methods are customized not only to utilize the underlying graph structure, but also the semantic information given in meta-models. An evaluation of the tool is provided in terms of a case study.

show abstract

“…Kelsen et al [17] propose an algorithm to split a model into submodels, where each submodel is conformant to the original metamodel with association multiplicities taken into account. Strüber et al [18] provide a splitting mechanism for both metamodels and models based on the component graphs of [10]. In [19], Strüber et al use [10] as the basis of an approach to split a model based on the relevance of its elements using information retrieval methods.…”

Section: Related Workmentioning

confidence: 99%

Fragmenta: A theory of fragmentation for MDE

Amálio

Lara

Guerra

2015

2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract-Model-Driven Engineering (MDE) promotes models throughout development. However, models may become large and unwieldy even for small to medium-sized systems. This paper tackles the MDE challenges of model complexity and scalability. It proposes FRAGMENTA, a theory of modular design that breaks down overall models into fragments that can be put together to build meaningful wholes, in contrast to classical MDE approaches that are essentially monolithic. The theory is based on an algebraic description of models, fragments and clusters based on graphs and morphisms. The paper's novelties include: (i) a mathematical treatment of fragments and a seaming mechanism of proxies to enable inter-fragment referencing, (ii) fragmentation strategies, which prescribe a fragmentation structure to model instances, (iii) FRAGMENTA's support for both top-down and bottom-up design, and (iv) our formally proved result that shows that inheritance hierarchies remain well-formed (acyclic) globally when fragments are composed provided some local fragment constraints are met.

show abstract

Towards a Distributed Modeling Process Based on Composite Models

Cited by 14 publications

References 14 publications

A Variability-Based Approach to Reusable and Efficient Model Transformations

A Variability-Based Approach to Reusable and Efficient Model Transformations

Tool support for clustering large meta-models

Fragmenta: A theory of fragmentation for MDE

Contact Info

Product

Resources

About