FamilyBased Modeling and Analysis for Probabilistic Systems – Featuring ProFeat
 12 Citations
 824 Downloads
Abstract
Featurebased formalisms provide an elegant way to specify families of systems that share a base functionality and differ in certain features. They can also facilitate an allinone analysis, where all systems of the family are analyzed at once on a single family model instead of onebyone. This paper presents the basic concepts of the tool \(\textsc {ProFeat}\), which provides a guardedcommand language for modeling families of probabilistic systems and an automatic translation of family models to the input language of the probabilistic model checker \(\textsc {Prism}\). This translational approach enables a familybased quantitative analysis with Prism. Besides modeling families of systems that differ in system parameters such as the number of identical processes or channel sizes, \(\textsc {ProFeat}\) also provides special support for the modeling and analysis of (probabilistic) product lines with dynamic feature switches, multifeatures and feature attributes. By means of several case studies we show how \(\textsc {ProFeat}\) eases familybased modeling and compare the onebyone and allinone analysis approach.
Keywords
Product Line Model Checker Feature Module Software Product Line Feature Combination1 Introduction
Feature orientation is a popular paradigm for the development of customizable software systems (see, e.g., [3, 7, 29]). Formalisms with featureoriented concepts provide an elegant way to specify families of systems that can be seen as variants, sharing some base functionality but differing in the combinations of features. The most prominent application of featureoriented formalisms are software product lines [12]. Several techniques for the analysis of featureoriented models and software product lines using testing, type checking, static analysis, theorem proving or model checking have been proposed and implemented in tools (see, e.g., [35] for an overview). The focus of the paper is on a featureoriented formalism for the quantitative analysis of families of probabilistic systems modeled by discrete or continuoustime Markov chains or Markov decision processes (MDPs). For this purpose, we introduce ProFeat, a featureoriented extension of the input language of the probabilistic model checker Prism [28] together with an automatic translation of ProFeat models to pure (featureless) Prism models. To specify valid feature combinations, we rely on a featuremodel formalism similar to the Textual Variability Language (TVL) [8]. ProFeat also allows for (numerical) feature attributes and multifeatures [8, 15, 16].
ProFeat follows the approach of [21] for modeling product lines using the parallel composition of (possibly interacting) feature modules and a feature controller that synchronizes with the feature modules when dynamic switches of the feature combinations occur. The dynamics of the feature controller and its interactions with the feature modules are crucial to model dynamic product lines [13, 17, 20, 24]. Probabilistic dynamic product lines as presented in [21] allow, e.g., to model the frequencies of uncontrollable feature switches by stochastic distributions. The potential adaptations are then modeled by nondeterministic feature switches. In ProFeat the operational behavior of the feature modules and the feature controller are represented by an extension of Prism’s guarded command language, supporting constraints for the feature combinations and synchronization actions for the activation and deactivation of features. Thus, whereas [21] uses MDPlike models for both the feature modules and the feature controller and handcrafted translations of the featureoriented concepts into Prism language, the ProFeat framework provides an elegant way to specify the feature modules and feature controller and automatically generates corresponding Prism code.
The quantitative analysis of ProFeat models in terms of the (maximal or minimal) probabilities of path properties or expected costs can be carried out using Prism or other probabilistic model checkers that support \(\textsc {Prism}\)’s input language. Besides the translation of ProFeat models into Prism models, our implementation also supports the analysis of product lines by providing commands to trigger the Prism modelchecking engines either for the family model (“allinone”) or for each family member separately (“onebyone”). The onebyone analysis can be carried out sequentially or in parallel.
Besides static or dynamic product lines, ProFeat can also be used to specify families of probabilistic systems with the same functionality, but different system parameters. Examples for such system parameters that may constitute a family of systems are initial values of discrete variables (and hence the set of starting states), threshold values triggering a certain behavior or reset values, the sizes of a buffer, a data package, an encryption key, the number of redundant components, or of retries and the energy consumption for some send operation.^{1} In these cases, ProFeat’s familybased modeling approach and support for the onebyone analysis offers a convenient way to perform analysis benchmarks which till now are usually done using handcrafted templates. To illustrate the capabilities of ProFeat, we considered a series of examples and compared the performance of allinone and onebyone analyses using the three Prism engines Mtbdd, Hybrid and Sparse. While the Mtbdd engine is fully symbolic and carries out all computations using multiterminal binary decision diagrams (MTBDD), the numerical computations of the Sparse engine are carried out using sparse matrices, and the Hybrid engine relies on an MTBDDrepresentation of the model and a sparse representation of probability or expectation vectors. Our experimental results indicate that there is no clear superiority of the allinone analysis approach, no matter which of the three Prism engines is used. However, for wellknown product line models, where the base functionality contains most of the behaviors and features have comparably less behaviors, allinone approaches are feasible (especially within the Mtbdd engine).
Related Work. Various authors have presented modelchecking techniques for families of nonprobabilistic systems. For the automatic detection of feature interactions, Plath and Ryan [36] introduced a featureoriented extension of the input language of the model checker SMV and Apel et al. [5] presented the tool SPLVerifier. FeatureIDE [40] is a tool set supporting all phases of the softwareproductline development with connections to the theorem prover KeY and the model checker JPFBDD. Gruler et al. [25] introduced a featurebased extension of the process algebra CCS and presented modelchecking algorithms to verify requirements expressed in the \(\mu \)calculus. We are not aware of any implementation of this approach. Lauenroth et al. [34] deal with family models based on I/O automata with may (“variable”) and must (“common”) transitions and a model checker for a CTLlike temporal logic that has been adapted for reasoning about the variability of product lines. Featured transition systems (FTS) are labeled transition systems with annotations for the feature combinations of static product lines [11] or a variant of dynamic product lines [13]. The SNIP tool [9, 11, 15] relies on FTS specified using a featurebased extension of the modeling language Promela and allows for checking FTS against LTL properties onebyone or using a symbolic allinone verification algorithm. Its reengineered version ProVeLines [14] provides several extensions, including verification techniques for reachability properties with realtime constraints. For branchingtime temporallogic specifications, [10, 13] proposed a symbolic modelchecking approach for (adaptive) FTS. We are not aware of an implementation of the approach of [13]. In [10], an allinone analysis based on the featureoriented extension of the SMV input language by [36] has been proposed, which allows verifying static product lines using the (nonprobabilistic) symbolic model checker NuSMV. This extension of SMV follows the compositional featureoriented software design paradigm (as we do) but puts the emphasis on superimposition [1, 2, 30], rather than parallel composition of feature behaviors [21].
None of the approaches mentioned above deals with probabilistic behaviors. To the best of our knowledge, there is no other tool that provides support for familybased probabilistic model checking of dynamic product lines. The benefits of probabilistic model checking for the analysis of adaptive software has been already drawn by Filieri et al. [22]. The work on modelchecking algorithms for parametric Markov chains [18, 27] and tool support in the model checkers Param [26] (which has been reimplemented and integrated in Prism) and PROPhESY [19] is orthogonal. By computing rational functions for the probabilities of reachability conditions or expected accumulated costs, these techniques can be seen as an allinone analysis of families of probabilistic systems with the same state space, but different transition probabilities. Ghezzi and Sharifloo [23] and the recent work by Rodrigues et al. [37] illustrate the potential of parametric probabilistic modelchecking techniques for the analysis of product lines. The ProFeat language can handle probability parameters as well and translate them to Prism code. However, there is no direct connection between ProFeat and the parametric probabilistic model checkers as they do not support multiple initial states. The recent work by Beek et al. [39] presents a framework for the analysis of software product lines using statistical model checking. An approach towards a familybased performance analysis of dynamic probabilistic product lines arising from UML activity diagrams has been presented by [32].
Outline. Section 2 presents the main principles of the ProFeat language. Details on the automatic generation of Prism code from ProFeat models as well as explanations on ProFeat’s support for the allinone and onebyone analysis will be given in Sect. 3. Section 4 reports on experimental studies. A brief conclusion is provided in Sect. 5. The source code of ProFeat can be obtained at https://wwwtcs.inf.tudresden.de/ALGI/PUB/FASE16.
2 Modeling Families of Systems: The ProFeat Language
A ProFeat model might represent a family of randomized protocols or other probabilistic systems that can be modeled by finitestate Markovian models, such as discrete or continuoustime Markov chains (DTMCs, or CTMCs, respectively) or Markov decision processes (MDPs). Therefore, the model consists of two parts: the declaration of the family, and a compact featureoriented representation of the operational behavior of all family members. Inspired by the application of featureoriented formalisms for software product lines, a family member is specified by some combination of features, each either active or inactive. The language constructs for the declaration of feature models, i.e., the valid feature combinations, are inspired by the Textual Variability Language (TVL) [8]. For the definition of the operational behaviors, we adopt the guardedcommand input language of the model checker Prism [28] and extend it by featurespecific concepts presented in [21]. Guards in commands of a Prism module can contain constraints for feature combinations. To model dynamic product lines, dynamic feature switches may occur by interactions with a feature controller, which is represented by a separate Prism module with synchronization actions for activating and deactivating features. Apart from feature models, other families of probabilistic systems that differ, e.g., in the number of processes, the queue size or other system parameters can easily be modeled. For instance, existing parametrized Prism models are usually checked within Prism’s experiment environment in a onebyone fashion. Within ProFeat only minor modifications are necessary to represent the whole family of systems that differ in the system parameters.
We illustrate the modeling approach of ProFeat using a simple producerconsumer model. The system consists of a single producer that enqueues jobs with probabilistic workload sizes into a FIFO buffer handed to one or more workers. One worker can only process one package at a time and the duration of the processing is determined by the workpackage size. Varying the buffer size, the number of workers, the processing speed of individual workers or the load caused by the producer yields different variants, i.e., families of systems.
2.1 Feature Modeling
A product line comprises a set of feature combinations, which are defined through a feature model. For the producerconsumer product line, the following figure
depicts a feature diagram, the standard formalism to define feature models in the softwareengineering domain, and a part of its declaration in ProFeat. Similar to feature diagrams, where each feature is represented by a rectangular node, ProFeat uses textual featureblocks to declare features and also has a treelike structure. The root feature (denoted by System in the diagram) is a special feature, representing the base functionality on which the product line is built upon. Each feature can be decomposed into one or more subfeatures. Here, the System is decomposed into four subfeatures. An all of decomposition indicates that all subfeatures are required in every feature combination whenever their parent feature is active. As used by the Workers feature, the some of operator implies that at least one of the subfeatures has to be active if the parent is active. In addition to the one of operator (which requires exactly one subfeature), the decomposition can also be given by a cardinality. Optional features are preceded by the optional keyword, indicating that the feature may or may not be part of a valid feature combination, regardless of the decomposition operator. ProFeat has builtin support for multifeatures [15], i.e., features that can appear more than once in a feature combination. The number of instances is given in brackets behind the feature name. In the producerconsumer example, the Workers feature is decomposed into three distinct copies of the Worker feature. It is important to note that the decomposition operator ranges over the feature instances. Thus, the some operator could be replaced by cardinality [1..3] in the above listing. Multifeatures can be marked optional as well. Then, each individual copy of the multifeature is an optional feature. Besides multifeatures, the ProFeat language supports nonBoolean features in the form of numeric feature attributes [8]. In the example shown above, the Worker has the attribute speed which can take any integer value from 1 to 5. Access to feature attributes is possible regardless of whether the corresponding feature is active or not. The combination of multifeatures and feature attributes enables a compact representation of complex product lines.
The introduction of multifeatures necessitates the distinction between features and feature instances. In ProFeat, each feature instance is uniquely identified by its fully qualified name. Subfeature instances as well as feature attributes are addressed using the familiar dotnotation. Instances of multifeatures are referred to by an arraylike syntax. For example, the fully qualified name of the second worker’s speed attribute is root.Workers.Worker[1].speed. As long as the qualified name is unambiguous, the prefix can be omitted. For instance, the name Worker[1].speed is valid as well.
A feature block may also contain crosstree constraints over feature instances and feature attributes. In our example, the first constraint given in the root feature expresses that the first two Worker instances must be active whenever the Fast feature is active. The second constraint limits the accumulated speed of the first two workers. A constraint can be preceded by the initial keyword, which only affects the initial set of valid feature combinations. Obviously, this distinction is only relevant for dynamic product lines.
Behavior of Features. In a ProFeat model, the declarative feature model is strictly separated from the operational behavior of features. A feature may be
Another means for communication besides shared variables is synchronization between feature modules. A command can be labeled with an action that is placed between the square brackets preceding the guard. If two or more modules share an action, they are forced to take the labeled transitions simultaneously. However, if any of those modules cannot take the transition (because its guard is not fulfilled), then the action is blocked, so that none of the modules can take the transition. In our running example, a worker synchronizes with the feature module implementing the FIFO buffer over the dequeue action to obtain a new work package (line 11). In ProFeat, action labels can be indexed using an arraylike syntax. In case of multifeatures, the implicit id parameter evaluates to the index of the feature instance. Thus, there exist three distinct dequeue actions in our model. By default, feature modules of inactive features do not block actions. Thus, with regard to synchronization, deactivating a feature has the same effect as removing it entirely from the model. This is useful if the model is fully synchronous, i.e., if there is a global action that synchronizes over all transitions. However, in some cases it is crucial that an inactive feature hinders active features to synchronize with its actions. In the producerconsumer example, an inactive worker should not take a work package out of the queue (line 11). Therefore, its dequeue action is modeled as blocking using the block keyword inside the feature module (line 3).
Specification of Costs and Rewards. As in Prism, states and transitions in ProFeat can be augmented with costs and rewards. This allows reasoning
about quantitative measures, such as energy consumption, performance and throughput. Costs and rewards are defined as a part of feature declarations using the keyword rewards. In the listing on the left, the energy consumption of a worker is specified depending on its processing speed.
2.2 Parametrization
While ProFeat provides special support for featureoriented modeling, families can also be formed by ranging over system parameters. In our running example,
such a parameter might be the FIFO buffer size. Parameters are declared in a family block, as shown on the left. Similar to feature attributes, system parameters can be constrained as well. Furthermore, a family declaration can be combined with a feature model, resulting in a family that is both defined by system parameters and all valid initial feature combinations. To declare subsets of valid feature combinations as initial ones, ProFeat provides the initial constraint keyword (see line 3 of the listing). Valid feature combinations not fulfilling the listed constraints are still possible during runtime by dynamic feature switches.
System parameters can be used anywhere in the model description, including guards, probabilities and costs/rewards. In contrast to feature attributes, system parameters are constant for each instance of a family. This has an important consequence: parameters can be used to specify the range of variables, the size of arrays, the range of for loops and even the number of multifeature instances. Thus, system parameters can directly influence the structure of the system.
3 Implementation
We have implemented a software tool^{2} that translates a ProFeat model into the input language of the model checker Prism. This translationbased approach enables the use of existing machinery for the verification and quantitative analysis of ProFeat models. The ProFeat tool furthermore supports the translation of queries into Prism’s properties file format. Thus, queries can be formulated in the extended syntax of ProFeat and allow reasoning about featurespecific properties. In this section, we provide a semantics for the ProFeat language and highlight notable steps of the translation process. The compositional modeling framework for probabilistic dynamic product lines by [21] provides a translation of feature modules under a feature controller into the input language of Prism, naturally mapping feature composition to the parallel composition of Prism. Thus, the semantics of the behavioral model of ProFeat is defined in terms of the Prism language semantics. The semantics of ProFeat’s feature modeling formalism is given by the semantics of TVL [8] extended with multifeatures as described in [15].
3.1 Translation of FeatureSpecific Constructs
In ProFeat, the access to the feature combination is provided through the use of the active function and the activate and deactivate updates of the feature controller. We encode feature combinations by a set of integer variables with range [0..1], which simplifies the handling of feature cardinalities (compared to a Boolean encoding). Instead of creating one variable per feature instance, the tool generates one variable per atomic set to reduce the number of variables: An atomic set is a set of features that can be treated as a unit as they never appear separately in a feature combination [38]. Given this representation, the translation of the active function is simple: The call to active is replaced by a check testing whether the atomicset variable evaluates to 1. Analogously, the activate and deactivate updates assign a 0 or a 1 to the corresponding variable, respectively. However, the feature controller cannot change the feature combination arbitrarily: As an update has to yield a valid feature combination, the translation has to add a guard to commands containing atomicset variable updates. This guard is synthesized from the feature model and evaluates to false if the transition described by the command would result in an invalid feature combination.
Another aspect of the translation concerns the synchronization between the feature controller and the feature modules in case of feature activation and deactivation. Implicitly, an \(\textit{activate}_f\) action and a \(\textit{deactivate}_f\) action is created for each feature instance f. In Prism, commands can only be labeled with a single action. However, an update may activate or deactivate multiple feature instances at once, thus requiring multiple action labels per command for synchronization. To circumvent this restriction of the Prism language, the set of action labels is merged into a single action label. This solution requires special care in the translation of feature modules. Let us assume a command C labeled with the action \(\textit{activate}_f\). Then, we collect the action labels of all featurecontroller commands that activate the feature instance f. Finally, we create a copy of the command C for each collected action label. This translation realizes the intended synchronization between the feature controller and the feature modules, even in the case of multiple simultaneous feature activations and deactivations.
Lastly, the translation must ensure that feature modules of inactive features do not block actions, i.e., deactivating a feature should have the same effect as removing the corresponding feature modules from the model. To achieve this behavior, we take the following approach. Suppose the feature module M implements the feature instance f. Then, for each command in M that has the form \([\alpha ]~\textit{guard} \rightarrow \textit{update}\), a command \([\alpha ]~\lnot \texttt {active}(f) \rightarrow \textit{true}\) is generated. Thus, if the feature instance f is not active, the translated module does not block the action \(\alpha \). However, this command is not generated if the user explicitly requests the blocking of action \(\alpha \) by using the block keyword in the feature declaration.
3.2 AllinOne and OnebyOne Translation
Essentially, there are two different approaches for the analysis of a family of systems described by some ProFeat model: The onebyone and the allinone approach. Within a onebyone approach, each member of the family is analyzed separately. Differently, within an allinone approach, the whole family is encoded into a single Prism model and analyzed in a single run. The result of the allinone analysis is then interpreted for each member of the family, providing results as the members would have been analyzed separately. An allinone approach can potentially exploit the similarities between the family instances and speed up the analysis, but may require additional memory. However, a big advantage of the onebyone approach is that it can be easily parallelized. As we illustrate in our case studies (see Sect. 4), it depends on the model as well as the time and memory constraints which approach is appropriate. For this reason, ProFeat supports both, an allinone and a onebyone translation of the family model. Switching from one analysis approach to the other requires no adjustments to the model.
In case of onebyone translation, ProFeat generates a Prism model for every instance of the family. That is, for each valid valuation of the system parameters and for each initial feature combination, the system parameters are replaced by constants. If no family block is given, then one model for each valid initial feature combination is generated. The allinone translation generates a single Prism model with multiple initial states, one for each instance of the family. However, there is a technical difficulty in the translation into an allinone model: Array sizes, numbers of multifeatures and variable bounds can be defined in terms of system parameters. Hence, these parameters might depend on the initial state and thus are not known at translation time. Therefore, ProFeat instantiates these parametrized structures with their maximal size.
4 Experimental Studies
As ProFeat follows a translational approach, allinone and oneinone analyses can be carried out using the same modelchecking tool Prism, allowing for a conceptual comparison of both approaches. Besides a sequential onebyone analysis as usually performed within productline verification (see, e.g., [4]), we also provide results for analyzing the models generated by the onebyone translation in parallel. Clearly, under the quite unrealistic assumption that lots of CPU cores (which allow for parallelization) and enough memory is provided, a parallel execution is likely to outperform an allinone approach. For our experiments we used a Linux machine with two 8core Intel Xeon E52680 CPUs running at 2.7 GHz and equipped with 384 GBytes of RAM, hyperthreading enabled. Thus, we restricted ourselves to an execution of 32 analyses in parallel.
4.1 The ProducerConsumer Example

Best Buffer. A static product line which parametrizes over the buffer size. Here, we ask for the buffer size for which minimal expected storage costs arise until a certain number of jobs are processed.

Best Worker. This family parametrizes over all possible combinations of workers. Within this family model, we ask for the combination of workers where the minimal expected energy is required to finish a given number of jobs.

Distributions. Here, we consider different workload distributions as parameter space of the model. The goal is to compute the distribution where the expected energy required to finish a certain number of jobs is minimal.
In some cases, where the number of instances is exponential in the family parameter (cf. Fig. 1c – Best Worker), the allinone analysis approach outperforms the onebyone approach and can even keep up with the parallel computation. In other cases (cf. Fig. 1b – Best Buffer), the allinone approach was only superior up to a system size of 14. For the third model variant (cf. Fig. 1d – Distributions), the allinone and onebyone approaches asymptotically displayed similar performance. Overall, there is a no clear trend on which approach is favorable, the onebyone or the allinone analysis.
4.2 FeatureAware Case Studies
The development of \(\textsc {ProFeat}\) has been first and foremost motivated by several studies from the domain of featureoriented systems such as product lines, where allinone analysis approaches turned out to outperform the traditional onebyone analysis approach. In this section, we demonstrate how (probabilistic) versions of classical product lines can be modeled and analyzed with \(\textsc {ProFeat}\).
Body Sensor Network Product Line. A Body Sensor Network (BSN) system is a network of connected sensors sending measurements to a central entity which evaluates the data and identifies health critical situations. In [37], a BSN product line with features for several sensors has been introduced. The approach presented in [37] follows the ideas by [23] towards parameterized DTMC models: For each feature, a Boolean parameter f is 1 if the feature is active and 0 otherwise. A factor p is multiplied to the probability of every transition, where \(p{=}f\) in case the feature enables the transition and \(p=1{}f\) otherwise. Parametric model checkers are then used to compute a single formula which for each feature combination evaluates to the probability of reaching a successful configuration, i.e., the reliability of the BSN. The authors of [37] report that the parametric approach using \(\textsc {Param}\) can be seven times faster, a novel symbolic boundedsearch approach can be eleven times faster, and a handcrafted (model dependent) compositional parametric approach can even be 100 times faster than a \(\textsc {Prism}\)based onebyone analysis. For obtaining the results, three different modelchecking tools have been used. Furthermore, special tailored scripts were required to perform the onebyone analysis and to evaluate the formulas returned by the parametric model checkers. With \(\textsc {ProFeat}\) the feature model of the BSN product line can be directly incorporated into the parametric model specified by [37], as \(\textsc {ProFeat}\)’s representation of features as Boolean parameters is compatible with the approach by [23]. Thus, \(\textsc {ProFeat}\) allows for an allinone approach on the same model as of [37] and simplifies the comparison to onebyone analysis also concerning different modelchecking engines such as the explicit or symbolic engines of \(\textsc {Prism}\).
In the first line of Table 1, we show the results of our experiments for computing the same reliability probability as in [37]. The allinone approach turns out to be \(\approx \)100 times faster than the onebyone approach, independent of the chosen engine. Hence, \(\textsc {ProFeat}\) directly enables a speed up of the analysis time in the same magnitude as handcrafted decomposition optimizations by [37].
Elevator Product Line. A classical (nonprobabilistic) product line considers an elevator system, introduced by [36] for checking feature interactions. It has been then considered in several case studies issuing familybased productline verification (see, e.g., [4, 15]). An elevator system is modeled by a cabin which can transport persons to floors of a building. The persons first have to push a button at the floor and then in the cabin for calling the elevator and defining a direction where to ride, respectively. In its basic version [36], the product line comprises 32 products built by five features, not changeable after deployment. We extend this product line in various aspects. First, we resolve some nondeterministic choices by probabilities when appropriate, e.g., modeling the request rate of a person and introducing a probability of failure. Second, we add a service feature, which enables to call technical staff repairing the elevator or change feature combinations. As a consequence, our elevator system is a dynamic product line where features can be changed during runtime. Third, we modeled dynamic feature changes as nondeterministic choices in the feature controller. This yields an MDP model for which a strategysynthesis problem can be considered: Compute best and worstcase strategies on how to activate or deactivate features to reach certain goals [21]. We deal with a simple instance of the elevator which can transport one person and where at most two persons act in the system. Our product lines have 64 feature combinations each, parametrized over the number of floors (24) in the building. We finally consider the family of the three product lines, containing 192 single instances of the elevator system. We asked for the minimal probability that if the cabin is on the ground floor and the top floor is requested, the probability to serve the top floor within the next three steps is greater than 0.99. Our analysis results are depicted in Table 1, where especially for larger instances the Mtbdd allinone analysis outperforms other approaches and engines. Notice that the number of MTBDD nodes of the family model containing all three elevator product lines (cf. the row above the double rule) is greater than the sum of nodes of the family models for each product line. Possibly, other MTBDD variable orderings, e.g., provided by methods presented in [31], could yield smaller model representations and faster allinone analyses.
4.3 Benchmark Suite Examples
Analysis times (in seconds) of feature and benchmark suite models
Model  MTBDD nodes  Mtbdd  Hybrid  Sparse  

family  separate  all  1by1  par  all  1by1  par  all  1by1  par  
BSN  5651  111507  1  129  25  1  128  25  1  128  25 
Elevator (2 floors)  42254  1329204  1  65  7  2  49  7  1  45  7 
Elevator (3 floors)  151274  4924349  4  223  11  98  2531  96  7  286  18 
Elevator (4 floors)  420448  13519274  15  910  32  2601  54262  1952  56  2008  83 
Elevator(24 floors)  779569  19772827  29  1199  49  5089  56843  2052  74  2339  106 
CSMA(2–4 processes)  633997  634076  timeout  not supported  1236  1251  1220  
“  “  timeout  3660  3577  3384  1078  1013  954  
Stabilization (3–21 processes)  4340  10662  2036  1643  932  251  37  22  129  33  20 
“  “  \(\ll \) 1  1  2  not supported  122  24  15  
“  “  timeout  not supported  2629  476  269  
“  “  13  10  7  12  10  6  12  10  7  
“  “  13  10  7  13  10  7  13  10  6  
Philosophers (3–12)  82995  82689  9056  6212  3945  9722  5949  4009  out of memory  
PWCS (3 replicas, 1–9 writers)  134236  134190  49  26  15  232  165  130  314  271  220 
“  “  6564  2247  960  not supported  5473  1544  1230  
PWCS (3 writers, 1–7 replicas)  955505  958033  752  2279  1628  968  348  306  738  2209  1265 
“  “  timeout  not supported  1221  3857  2735 
5 Conclusions
We presented the language ProFeat for familybased modeling and analysis of probabilistic systems. To the best of our knowledge, ProFeat is the first modeling language for probabilistic dynamic product lines with tool support for an allinone and onebyone analysis without employing templates, scripting or different model descriptions. Whereas for experiments on productline inspired case studies an allinone approach turns out to be usually faster than a onebyone approach, this cannot be generalized to arbitrary families, e.g., when only a few common behaviors exist within the family members. There are various directions for further work, e.g., establishing an allinmany approach clustering families and thus mixing both approaches. Symmetry reductions on the model could also speed up an allinone analysis, especially within multifeatures.
Footnotes
 1.
To ensure the finiteness of the family model (which is necessary to employ standard modelchecking techniques) the range of the parameters is required to be finite.
 2.
For the Haskell source code of the tool, we refer to https://wwwtcs.inf.tudresden.de/ALGI/PUB/FASE16.
References
 1.Apel, S., Hutchins, D.: A calculus for uniform feature composition. ACM Trans. Program. Lang. Syst. 32(5), 19:1–19:33 (2010)CrossRefGoogle Scholar
 2.Apel, S., Janda, F., Trujillo, S., Kästner, C.: Model superimposition in software product lines. In: Paige, R.F. (ed.) ICMT 2009. LNCS, vol. 5563, pp. 4–19. Springer, Heidelberg (2009)CrossRefGoogle Scholar
 3.Apel, S., Kästner, C.: An overview of featureoriented software development. J. Object Technol. 8(5), 49–84 (2009)CrossRefGoogle Scholar
 4.Apel, S., von Rhein, A., Wendler, P., Groesslinger, A., Beyer, D.: Strategies for productline verification: Case studies and experiments. In: Proceedings of the International Conference on Software Engineering, ICSE 2013, pp. 482–491. IEEE (2013)Google Scholar
 5.Apel, S., Speidel, H., Wendler, P., von Rhein, A., Beyer, D.: Detection of feature interactions using featureaware verification. In: International Conference on Automated Software Engineering (ASE), pp. 372–375. IEEE (2011)Google Scholar
 6.Baier, C., Engel, B., Klüppelholz, S., Märcker, S., Tews, H., Völp, M.: A probabilistic quantitative analysis of probabilisticWrite/Copyselect. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 307–321. Springer, Heidelberg (2013)CrossRefGoogle Scholar
 7.Benavides, D., Segura, S., RuizCortés, A.: Automated analysis of feature models 20 years later: A literature review. Inf. Syst. 35(6), 615–636 (2010)CrossRefGoogle Scholar
 8.Classen, A., Boucher, Q., Heymans, P.: A textbased approach to feature modelling: Syntax and semantics of TVL. Sci. Comput. Program. 76(12), 1130–1143 (2011)CrossRefGoogle Scholar
 9.Classen, A., Cordy, M., Heymans, P., Legay, A., Schobbens, P.Y.: Model checking software product lines with SNIP. STTT 14(5), 589–612 (2012)CrossRefGoogle Scholar
 10.Classen, A., Cordy, M., Heymans, P., Legay, A., Schobbens, P.Y.: Formal semantics, modular specification, and symbolic verification of productline behaviour. Sci. Comput. Program. 80, 416–439 (2014)CrossRefGoogle Scholar
 11.Classen, A., Cordy, M., Schobbens, P.Y., Heymans, P., Legay, A., Raskin, J.F.: Featured transition systems: Foundations for verifying variabilityintensive systems and their application to LTL model checking. IEEE Trans. Softw. Eng. 39(8), 1069–1089 (2013)CrossRefGoogle Scholar
 12.Clements, P., Northrop, L.: Software Product Lines: Practices and Patterns. AddisonWesley Professional, Reading (2001)Google Scholar
 13.Cordy, M., Classen, A., Heymans, P., Legay, A., Schobbens, P.Y.: Model checking adaptive software with featured transition systems. In: Cámara, J., Lemos, R., Ghezzi, C., Lopes, A. (eds.) Assurances for SelfAdaptive Systems. LNCS, vol. 7740, pp. 1–29. Springer, Heidelberg (2013)CrossRefGoogle Scholar
 14.Cordy, M., Classen, A., Heymans, P., Schobbens, P.Y., Legay, A.: ProVeLines: a product line of verifiers for software product lines. In: 17th International Software Product Line Conference (SPLC), pp. 141–146. ACM (2013)Google Scholar
 15.Cordy, M., Schobbens, P.Y., Heymans, P., Legay, A.: Beyond boolean productline model checking: Dealing with feature attributes and multifeatures. In: Proceedings of the International Conference on Software Engineering, ICSE 2013, pp. 472–481. IEEE Press (2013)Google Scholar
 16.Czarnecki, K., Helsen, S., Eisenecker, U.W.: Formalizing cardinalitybased feature models and their specialization. Softw. Process: Improv. Pract. 10(1), 7–29 (2005)CrossRefGoogle Scholar
 17.Damiani, F., Schaefer, I.: Dynamic deltaoriented programming. In: Proceedings of the 15th International Software Product Line Conference, SPLC 2011. ACM (2011)Google Scholar
 18.Daws, C.: Symbolic and parametric model checking of discretetime markov chains. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 280–294. Springer, Heidelberg (2005)CrossRefGoogle Scholar
 19.Dehnert, C., Junges, S., Jansen, N., Corzilius, F., Volk, M., Bruintjes, H., Katoen, J.P., Ábrahám, E.: PROPhESY: A PRObabilistic parameter synthesis tool. In: Kroening, D., Păsăreanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 214–231. Springer, Heidelberg (2015)CrossRefGoogle Scholar
 20.Dinkelaker, T., Mitschke, R., Fetzer, K., Mezini, M.: A dynamic software product line approach using aspect models at runtime. In: Proceedings of the 1st Workshop on Composition and Variability (2010)Google Scholar
 21.Dubslaff, C., Baier, C., Klüppelholz, S.: Probabilistic model checking for featureoriented systems. In: Chiba, S., Tanter, É., Ernst, E., Hirschfeld, R. (eds.) Transactions on AOSD XII. LNCS, vol. 8989, pp. 180–220. Springer, Heidelberg (2015)Google Scholar
 22.Filieri, A., Ghezzi, C., Tamburrelli, G.: A formal approach to adaptive software: Continuous assurance of nonfunctional requirements. Formal Aspects Comput. 24(2), 163–186 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
 23.Ghezzi, C., Sharifloo, A.M.: Modelbased verification of quantitative nonfunctional properties for software product lines. Inf. Softw. Technol. 55(3), 508–524 (2013)CrossRefGoogle Scholar
 24.Gomaa, H., Hussein, M.: Dynamic software reconfiguration in software product families. In: van der Linden, F.J. (ed.) PFE 2003. LNCS, vol. 3014, pp. 435–444. Springer, Heidelberg (2004)CrossRefGoogle Scholar
 25.Gruler, A., Leucker, M., Scheidemann, K.: Modeling and model checking software product lines. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 113–131. Springer, Heidelberg (2008)CrossRefGoogle Scholar
 26.Hahn, E.M., Hermanns, H., Wachter, B., Zhang, L.: PARAM: A model checker for parametric markov models. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 660–664. Springer, Heidelberg (2010)CrossRefGoogle Scholar
 27.Hahn, E.M., Hermanns, H., Zhang, L.: Probabilistic reachability for parametric Markov models. Softw. Tools Technol. Transf. 13(1), 3–19 (2011)CrossRefGoogle Scholar
 28.Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A tool for automatic verification of probabilistic systems. In: Palsberg, J., Hermanns, H. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 441–444. Springer, Heidelberg (2006)CrossRefGoogle Scholar
 29.Kang, K.C., Cohen, S.G., Hess, J.A., Novak, W.E., Peterson, A.S.: Featureoriented domain analysis (FODA) feasibility study. Technical Report CMU/SEI90TR21, CarnegieMellon University (1990)Google Scholar
 30.Katz, S.: A superimposition control construct for distributed systems. ACM Trans. Program. Lang. Syst. 15(2), 337–356 (1993)CrossRefGoogle Scholar
 31.Klein, J., Baier, C., Chrszon, P., Daum, M., Dubslaff, C., Klüppelholz, S., Märcker, S., Müller, D.: Advances in symbolic probabilistic model checking with PRISM. In: Proceedings of the 22th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS. Springer, to appear (2016)Google Scholar
 32.Kowal, M., Schaefer, I., Tribastone, M.: Familybased performance analysis of variantrich software systems. In: Gnesi, S., Rensink, A. (eds.) FASE 2014 (ETAPS). LNCS, vol. 8411, pp. 94–108. Springer, Heidelberg (2014)CrossRefGoogle Scholar
 33.Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: Proceedings of the Quantitative Evaluation of Systems (QEST 2012), pp. 203–204. IEEE, 2012. https://github.com/prismmodelchecker/prismbenchmarks/
 34.Lauenroth, K., Pohl, K., Toehning, S.: Model checking of domain artifacts in product line engineering. In: 24th IEEE/ACM International Conference on Automated Software Engineering (ASE), pp. 269–280. IEEE (2009)Google Scholar
 35.Meinicke, J., Thüm, T., Schröter, R., Benduhn, F., Saake, G.: An overview on analysis tools for software product lines. In: 18th International Software Product Lines Conference (SPLC), pp. 94–101. ACM (2014)Google Scholar
 36.Plath, M., Ryan, M.: Feature integration using a feature construct. Sci. Comput. Program. 41(1), 53–84 (2001)CrossRefzbMATHGoogle Scholar
 37.Rodrigues, G.N., Alves, V., Nunes, V., Lanna, A., Cordy, M., Schobbens, P.Y., Sharifloo, A.M., Legay, A.: Modeling and verification for probabilistic properties in software product lines. In: High Assurance Systems Engineering (HASE), pp. 173–180. IEEE (2015)Google Scholar
 38.Segura, S.: Automated analysis of feature models using atomic sets. In: SPLC (2), pp. 201–207 (2008)Google Scholar
 39.ter Beek, M.H., Legay, A., LluchLafuente, A., Vandin, A.: Statistical analysis of probabilistic models of software product lines with quantitative constraints. In: 19th International Conference on Software Product Line (SPLC), pp. 11–15. ACM (2015)Google Scholar
 40.Thüm, T., Kästner, C., Benduhn, F., Meinicke, J., Saake, G., Leich, T.: FeatureIDE: An extensible framework for featureoriented software development. Sci. Comput. Program. 79, 70–85 (2014)CrossRefGoogle Scholar