%0 Conference Proceedings
%T Composing Families of Timed Automata
%+ Institute for Systems and Computer Engineering, Technology and Science [Braga] (INESC TEC)
%+ Universidade do Minho = University of Minho  [Braga]
%A Cledou, Guillermina
%A Proença, José
%A Soares Barbosa, Luis
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 7th International Conference on Fundamentals of Software Engineering (FSEN)
%C Teheran, Iran
%Y Mehdi Dastani
%Y Marjan Sirjani
%I Springer International Publishing
%3 Fundamentals of Software Engineering
%V LNCS-10522
%P 51-66
%8 2017-04-26
%D 2017
%R 10.1007/978-3-319-68972-2_4
%K Software Product Lines
%K Featured Timed Automata
%K Compositionality
%Z Computer Science [cs]Conference papers
%X Featured Timed Automata (FTA) is a formalism that enables the verification of an entire Software Product Line (SPL), by capturing its behavior in a single model instead of product-by-product. However, it disregards compositional aspects inherent to SPL development. This paper introduces Interface FTA (IFTA), which extends FTA with variable interfaces that restrict the way automata can be composed, and with support for transitions with atomic multiple actions, simplifying the design. To support modular composition, a set of Reo connectors are modelled as IFTA. This separation of concerns increases reusability of functionality across products, and simplifies modelling, maintainability, and extension of SPLs. We show how IFTA can be easily translated into FTA and into networks of Timed Automata supported by UPPAAL. We illustrate this with a case study from the electronic government domain.
%G English
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01760866/document
%2 https://inria.hal.science/hal-01760866/file/459025_1_En_4_Chapter.pdf
%L hal-01760866
%U https://inria.hal.science/hal-01760866
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-FSEN
%~ IFIP-LNCS-10522