Composing Families of Timed Automata

Bibliographic Details
Main Author: Cledou, Guillermina
Publication Date: 2017
Other Authors: Proença, José Miguel Paiva, Barbosa, L. S.
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/1822/69302
Summary: 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.
id RCAP_13e7eecf1f8d6ab58d5fff8d2f441399
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/69302
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Composing Families of Timed AutomataSoftware Product LinesFeatured Timed AutomataCompositionalityCiências Naturais::Ciências da Computação e da InformaçãoScience & TechnologyFeatured 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.POCI-01-0145-FEDER-016826. NORTE-01-0145-FEDER-000037SpringerUniversidade do MinhoCledou, GuillerminaProença, José Miguel PaivaBarbosa, L. S.2017-102017-10-01T00:00:00Zconference paperinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/69302engCledou G., Proença J., Soares Barbosa L. (2017) Composing Families of Timed Automata. In: Dastani M., Sirjani M. (eds) Fundamentals of Software Engineering. FSEN 2017. Lecture Notes in Computer Science, vol 10522. Springer978-3-319-68971-50302-974310.1007/978-3-319-68972-2_4978-3-319-68972-2https://link.springer.com/chapter/10.1007/978-3-319-68972-2_4info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-11T07:36:47Zoai:repositorium.sdum.uminho.pt:1822/69302Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T16:33:13.266767Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Composing Families of Timed Automata
title Composing Families of Timed Automata
spellingShingle Composing Families of Timed Automata
Cledou, Guillermina
Software Product Lines
Featured Timed Automata
Compositionality
Ciências Naturais::Ciências da Computação e da Informação
Science & Technology
title_short Composing Families of Timed Automata
title_full Composing Families of Timed Automata
title_fullStr Composing Families of Timed Automata
title_full_unstemmed Composing Families of Timed Automata
title_sort Composing Families of Timed Automata
author Cledou, Guillermina
author_facet Cledou, Guillermina
Proença, José Miguel Paiva
Barbosa, L. S.
author_role author
author2 Proença, José Miguel Paiva
Barbosa, L. S.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Cledou, Guillermina
Proença, José Miguel Paiva
Barbosa, L. S.
dc.subject.por.fl_str_mv Software Product Lines
Featured Timed Automata
Compositionality
Ciências Naturais::Ciências da Computação e da Informação
Science & Technology
topic Software Product Lines
Featured Timed Automata
Compositionality
Ciências Naturais::Ciências da Computação e da Informação
Science & Technology
description 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.
publishDate 2017
dc.date.none.fl_str_mv 2017-10
2017-10-01T00:00:00Z
dc.type.driver.fl_str_mv conference paper
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/69302
url http://hdl.handle.net/1822/69302
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Cledou G., Proença J., Soares Barbosa L. (2017) Composing Families of Timed Automata. In: Dastani M., Sirjani M. (eds) Fundamentals of Software Engineering. FSEN 2017. Lecture Notes in Computer Science, vol 10522. Springer
978-3-319-68971-5
0302-9743
10.1007/978-3-319-68972-2_4
978-3-319-68972-2
https://link.springer.com/chapter/10.1007/978-3-319-68972-2_4
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833596019187646464

Similar Items