Composing Families of Timed Automata

Thumbnail Image
Date
2017
Authors
Guillermina Cledou
José Paiva Proença
Luís Soares Barbosa
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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. © 2017, IFIP International Federation for Information Processing.
Description
Keywords
Citation