A Refinement Relation for Families of Timed Automata

Autor: Guillermina Cledou, José Proença, Luís Soares Barbosa
Rok vydání: 2017
Předmět:
Zdroj: Lecture Notes in Computer Science ISBN: 9783319708478
SBMF
DOI: 10.1007/978-3-319-70848-5_11
Popis: Software Product Lines (SPLs) are families of systems that share a high number of common assets while differing in others. In component-based systems, components themselves can be SPLs, i.e., each component can be seen as a family of variations, with different interfaces and functionalities, typically parameterized by a set of features and a feature model that specifies the valid combinations of features. This paper explores how to safely replace such families of components with more refined ones. We propose a notion of refinement for Interface Featured Timed Automata (IFTA), a formalism to model families of timed automata with support for multi-action transitions. We separate the notion of IFTA refinement into behavioral and variability refinement, i.e., the refinement of the underlying timed automata and feature model. Furthermore, we define behavioral refinement for the semantic level, i.e., transition systems, as an alternating simulation between systems, and lift this definition to IFTA refinement. We illustrate this notion with examples throughout the text and show that refinement is a pre-order and compositional.
Databáze: OpenAIRE
načítá se...