| Title |
Composing Families of Timed Automata |
| ID_Doc |
79336 |
| Authors |
Cledou, G; Proença, J; Barbosa, LS |
| Title |
Composing Families of Timed Automata |
| Year |
2017 |
| Published |
|
| DOI |
10.1007/978-3-319-68972-2_4 |
| 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. |
| Author Keywords |
Software Product Lines; Featured Timed Automata; Compositionality |
| Index Keywords |
Index Keywords |
| Document Type |
Other |
| Open Access |
Open Access |
| Source |
Conference Proceedings Citation Index - Science (CPCI-S) |
| EID |
WOS:000452447400004 |
| WoS Category |
Computer Science, Software Engineering |
| Research Area |
Computer Science |
| PDF |
|