Team automata describe a network of automata with input and output actions, extended with synchronisation policies guiding how many input and output actions can synchronise. Given such a team automaton, one can reason over communication properties such as receptiveness (all sent messages must be received) and responsiveness (all pending receives must be satisfied). Featured team automata support variability in the development and analysis of teams by concisely describing a family of concrete product models for specific configurations determined by feature selection. The analysis of communication-safety properties in a product-wise manner quickly becomes impractical. Therefore, we lift the notions of receptiveness to the level of family models. We show that featured (weak) receptiveness of featured team automata characterises (weak) receptiveness for all product instantiations. So far we focused on identifying communication properties. However, verifying automatically these properties is non-trivial, as it may involve traversing a set of networks of interacting automata with a large state space. We are currently investigating (1) how to characterise communication properties for team automata (and its subsumed models) using test-free propositional dynamic logic, and (2) how to use this characterisation to verify communication properties using model checking. A prototypical tool supports the developed theory and interacts with mCRL2 for the model checking.