Featured Team Automata
Ref: CISTER-TR-210803 Publication Date: 20 to 22, Nov, 2021
Featured Team AutomataRef: CISTER-TR-210803 Publication Date: 20 to 22, Nov, 2021
We propose featured team automata to support variability in the development and analysis of teams, which are systems of reactive components that communicate according to specified synchronisation types. A featured team automaton concisely describes a family of concrete product models for specific configurations determined by feature selection. We focus on the analysis of communication-safety properties, but doing so product-wise quickly becomes impractical. Therefore, we investigate how to lift notions of receptiveness (no message loss) to the level of family models. We show that featured (weak) receptiveness of featured team automata characterises (weak) receptiveness for all product instantiations. A prototypical tool supports the developed theory.
Formal Methods (FM 2021).
Notes: This is a top conference in formal methods (Core A). This paper describes how to verify if no message is lost in a set of components (automata) where each method call that can synchronise with a pre-specified number of neighbours. This is formulated in the context of software product lines, where families of this components can be specified.