Configuration of hyper-graph based feature diagrams
نویسنده
چکیده
Software product line engineering has gained an exceptional attention and interest from scientific community in recent years as a consequence of reuse in mass software production. However, management of the common and variable characteristics and functionalities among a collection of software systems, which belong to the same application domain, is still a work in progress because it is neither a trivial activity nor can it be resolved applying conventional software engineering methodologies. One of the suggested solutions, and generally accepted, for elicitation, representation and management of variability among software systems given a domain is feature modelling. Feature diagram, the fundamental graphical representation of feature modelling, proposed two decades ago in the study "Feature-Oriented Domain Analysis" published by the Software Engineering Institute, is a powerful representation tool of product lines' variability, but at the same time a systematic element for product configuration. First proposal of feature diagram defined the underlying data structure by means of trees, while later proposals used (directed acyclic) graphs or defined a new semantic meaning for trees. Nevertheless, there is yet to be found a consensus for a definition of feature diagrams. Regardless of the definition, any representation ought to be accompanied by a methodology to not only validate the model but also assist with the configuration of a product, because it is part of any Computer Aided Software Engineering tool. This work focuses on a mathematical representation of feature diagrams, (acyclic forward) hyper-graphs, and takes advantage of their properties and existing traversal algorithms to propose simple and robust procedures to aid with the process of configuration. The first part reviews previous definitions of feature diagram and describes the formalism proposed within GIRO research group as well as two-phases configuration algorithms to generate partial configurations and to complete them. Second part empirically evaluates the validity of these algorithms for the hyper-graph formalism and assesses the performance of a representative set of selected test feature models. The outcome will be a detailed study of feature modelling variability mechanisms in software product lines along with a mathematical depiction of feature diagrams, which overcomes the problem of denoting the semantics of constraints when using graphs and trees representations, suitable and feasible validation and configuration phases algorithms and an empirical assessment of the proposed algorithms. Detta arbetë ar licensierat under ett Creative Commons Erkännande-IckeKommersiell-DelaLika 2.5 Sverige. This thesis is dedicated to each single human being, whose sole act of reading these …
منابع مشابه
The Hyper-Zagreb Index of Graph Operations
Let G be a simple connected graph. The first and second Zagreb indices have been introduced as vV(G) (v)2 M1(G) degG and M2(G) uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G) (degG(u) degG In this paper, the HyperZagreb index of the Cartesian p...
متن کاملTowards Multi-view Feature-Based Configuration
[Context & motivation] Variability models, feature diagrams ahead, have become commonplace in software product line engineering as a means to document variability early in the lifecycle. Over the years though, their application span has been extended to aid stakeholders in the configuration of software products. [Question/problem] However, current feature-based configuration techniques hardly s...
متن کاملModelling platform-based product configuration using programmed attributed graph grammars
The rationale of platform-based product configuration has been well recognized for the implementation of mass customization. A product platform refers to the conceptual structure and logical organization of product families from both customer and technical viewpoints. This provides a generic umbrella under which product configuration manifests itself through variant derivation within common pro...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010