Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking
Citations
444 citations
148 citations
Cites methods from "Featured Transition Systems: Founda..."
...A solution for the interrelation is to parameterize the base models to indicate which base model elements link to which feature [21]....
[...]
129 citations
100 citations
74 citations
Cites methods from "Featured Transition Systems: Founda..."
...This triggered a growing interest in modelling behavioural variability, which led to the application of formal models different from MTSs, but still with a transition system semantics, including first and foremost the highly elaborated framework based on featured transition systems [26,27], but also process-algebraic approaches [12–14,42,45,67], Petri nets [59], and finite state machines [57]....
[...]
References
5,174 citations
4,905 citations
"Featured Transition Systems: Founda..." refers methods in this paper
...Like our earlier prototype, SNIP verifies an fLTL property for all the products of a variability-intensive system at once, and pinpoints those that violate (respectively, satisfy) the property....
[...]
...Index Terms—Formal methods, model checking, verification, variability, features, software product lines Ç...
[...]
...The proposed FTS algorithms are semisymbolic, combining an automata-based model checking algorithm [72] with a symbolic encoding of sets of products....
[...]
4,752 citations
4,420 citations
"Featured Transition Systems: Founda..." refers background in this paper
...Only a few are conducted during domain engineering, i.e., when building the assets from which products are derived....
[...]
...To be usable in practice, FTSs also need a model checker with a modeling language that offers a sufficient level of abstraction....
[...]
3,502 citations