Now showing items 1-5 of 5
Incremental and Commutative Composition of State-Machine Models of Features
In this paper, we present a technique for incre- mental and commutative composition of state-machine models of features, using the FeatureHouse framework. The inputs to FeatureHouse are feature state-machines (or state-machine ...
Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
Product line (PL) engineering promotes the de- velopment of families of related products, where individual products are differentiated by which optional features they include. Modelling and analyzing requirements models ...
Merging Features in Featured Transition Systems
Featured Transition Systems (FTSs) is a popular representation for software product lines: an entire product line is compactly represented as a single transition-machine model, in which feature-specific behaviour is guarded ...
Measuring Behaviour Interactions between Product-Line Features
We suggest a method for measuring the degree to which features interact in feature-oriented software development. To this end, we extend the notion of simulation between transition systems to a similarity measure and lift ...
Large Aperiodic Semigroups
(World Scientific Publishing, 2015-11-01)
We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ...