Premium
2.3.2 Verification of Selection from Product Line Requirements
Author(s) -
Kaindl Hermann,
Mannion Mike
Publication year - 2005
Publication title -
incose international symposium
Language(s) - English
Resource type - Journals
ISSN - 2334-5837
DOI - 10.1002/j.2334-5837.2005.tb00671.x
Subject(s) - computer science , product (mathematics) , reuse , product design specification , selection (genetic algorithm) , software product line , set (abstract data type) , product line , expression (computer science) , systems engineering , product design , programming language , engineering , mathematics , manufacturing engineering , artificial intelligence , geometry , software , software development , waste management
A product line is a set of similar products e.g. spacecraft mission planning systems, mobile phones, and it facilitates reuse. From a given model of product line requirements, the requirements for new single systems in the product line can be selected. However, verifying that the selected requirements of any single system satisfy the variability constraints in the product line model is difficult especially when the models are large and complex. By modelling variability in the product line requirements using propositional calculus, a logical expression can be developed for the set of product line requirements and selection verification can be achieved by showing that the logical expression is satisfied. A case study using real‐world requirements provides empirical evidence of the computational feasibility of this approach. This paper presents formal semantics of variability representation in product line requirements and their use for verification of selection for single systems.