Mapping Cardinality-based Feature Models to Weighted Automata over Featured Multiset Semirings (Extended Version)
Robert M\"uller, Mathis Wei{\ss}, Malte Lochau

TL;DR
This paper introduces a novel formalism using weighted automata over featured multiset semirings to model the complex, potentially infinite configuration spaces of cardinality-based feature models, enhancing expressiveness and analysis capabilities.
Contribution
It proposes weighted automata over featured multiset semirings as a new formalism for modeling cardinality-based feature models, extending expressiveness beyond existing methods.
Findings
Formalism is more expressive than featured transition systems.
Tool implementation demonstrates practical applicability.
Preliminary experiments show computational feasibility.
Abstract
Cardinality-based feature models permit to select multiple copies of the same feature, thus generalizing the notion of product configurations from subsets of Boolean features to multisets of feature instances. This increased expressiveness shapes a-priori infinite and non-convex configuration spaces, which renders established solution-space mappings based on Boolean presence conditions insufficient for cardinality-based feature models. To address this issue, we propose weighted automata over featured multiset semirings as a novel behavioral variability modeling formalism for cardinality-based feature models. The formalism uses multisets over features as a predefined semantic domain for transition weights. It permits to use any algebraic structure forming a proper semiring on multisets to aggregate the weights traversed along paths to map accepted words to multiset configurations. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
