Featured Team Automata
Abstract
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.
Cite
@article{arxiv.2108.01784,
title = {Featured Team Automata},
author = {Maurice H. ter Beek and Guillermina Cledou and Rolf Hennicker and José Proença},
journal= {arXiv preprint arXiv:2108.01784},
year = {2021}
}
Comments
This is a paper accepted at FM'21 extended with proofs in appendix