Model Checking Adaptive Software with Featured Transition Systems

Cordy, Maxime; Classen, Andreas; Heymans, Patrick; Legay, Axel; Schobbens, Pierre‐Yves

doi:10.1007/978-3-642-36249-1_1

Cited by 25 publications

(34 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(ii) It allows us to relate approaches presented independently and in different areas but sharing, essentially, the same category of control data. This is, e.g., the case of the approaches based on modes of operation proposed by the Software Engineering [11] adaptation coordination strategies adaptation strategy 4.1 [48] adaptation rules adaptation strategy 5.3 [15] architecture architecture 3.1 [46] architecture architecture 3.2 [60] architecture architecture 3.2 [66] module stack architecture 3.2 [22] current workflow architecture 3.2 [7] connectors architecture 3.2 [11] architecture architecture 4.1 [76] effector channel architecture 4.3 [48] set of activities architecture 5.3 [61] entire programs entire program 4.1 [55] rewrite rules entire program 4.2 [35] processes entire program 4.3 [30] processes entire program 4.3 [28] features operation mode 4.1 [53] regions operation mode 4.1 [83] operation mode operation mode 4.1 [1] active configuration operation mode 4.1 [72] active configuration operation mode 4.1 [19] control proposition operation mode 4.1 [82] steady state programs operation mode 4.1 [42] state space zones operation mode 4.1 [33] graph rewrite rules operation mode 4.2 [80] base level Petri net operation mode 4.3 [51] adaptor processes operation mode 4.3 [16] adaptable (local) processes operation mode 4.3 [69] context stack operation mode 5.1 [36] advices operation mode 5.2 [44] policies operation mode 5.3 community with paradigm-oriented approaches and by the Theoretical Computer Science community with automata and process-algebraic approaches. (iii) It allows us to compare approaches apparently similar (and falling in the same section) but based on different categories of control data.…”

Section: When Is a Software Component Adaptive?mentioning

confidence: 99%

“…A first example of this tradition are the Adaptive Featured Transition Systems (A-FTS) of [28], which were introduced for the purpose of model checking adaptive software (with a focus on software product lines). A-FTSs are a sort of transition systems where states are composed by the local state of the system, its configuration (set of active features) and the configuration of the environment.…”

Section: Automata-based Approaches To Adaptationmentioning

confidence: 99%

See 1 more Smart Citation

A White Box Perspective on Behavioural Adaptation

Bruni

Corradini

Gadducci

et al. 2015

Software, Services, and Systems

View full text Add to dashboard Cite

Abstract. We present a white-box conceptual framework for adaptation developed in the context of the EU Project ASCENS coordinated by Martin Wirsing. We called it CoDa, for Control Data Adaptation, since it is based on the notion of control data. CoDa promotes a neat separation between application and adaptation logic through a clear identification of the set of data that is relevant for the latter. The framework provides an original perspective from which we survey a representative set of approaches to adaptation, ranging from programming languages and paradigms to computational models and architectural solutions.

show abstract

Section: When Is a Software Component Adaptive?mentioning

confidence: 99%

Section: Automata-based Approaches To Adaptationmentioning

confidence: 99%

A White Box Perspective on Behavioural Adaptation

Bruni

Corradini

Gadducci

et al. 2015

Software, Services, and Systems

View full text Add to dashboard Cite

show abstract

“…Adaptive Featured Transition Systems (A-FTS) have been introduced in [6] for the purpose of model checking adaptive software (with a focus on software product lines). A-FTS are a sort of transition systems where states are composed by the local state of the system, its configuration (set of active features) and the configuration of the environment.…”

Section: Related Workmentioning

confidence: 99%

“…Properties are expressed in AdaCTL, a variant of the computation-tree temporal logic CTL. Contrary to aias which are equipped with suitable composition operations, A-FTS are seen in [6] as monolithic systems.…”

Section: Related Workmentioning

confidence: 99%

Adaptable Transition Systems

Bruni

Corradini

Gadducci

et al. 2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. We present an essential model of adaptable transition systems inspired by white-box approaches to adaptation and based on foundational models of component based systems. The key feature of adaptable transition systems are control propositions, imposing a clear separation between ordinary, functional behaviours and adaptive ones. We instantiate our approach on interface automata yielding adaptable interface automata, but it may be instantiated on other foundational models of component-based systems as well. We discuss how control propositions can be exploited in the specification and analysis of adaptive systems, focusing on various notions proposed in the literature, like adaptability, control loops, and control synthesis.

show abstract

“…An alternative is to organize the variability between these programs into features, a concept borrowed from software product line engineering (SPLE) [4]. In the latter discipline, a feature is an added functionality that meet a requirement of customers.…”

Section: Introductionmentioning

confidence: 99%

A framework for the rigorous design of highly adaptive timed systems

Cordy

Legay

Schobbens

et al. 2013

2013 1st FME Workshop on Formal Methods in Software Engineering (FormaliSE)

Self Cite

View full text Add to dashboard Cite

Abstract-Adaptive systems can be regarded as a set of static programs and transitions between these programs. These transitions allow the system to adapt its behaviour in response to unexpected changes in its environment. Modelling highly dynamic systems is cumbersome, as these may go through a large number of adaptations. Moreover, often they must also satisfy real-time requirements whereas adaptations may not complete instantaneously. In this paper, we propose to model highly adaptive systems as dynamic real-time software product lines, where software products are able to change their features at runtime. Adaptive features allow one to design systems equipped with runtime reconfiguration capabilities and to model changes in their environment, such has failure modes. We define Featured Timed Game Automata, a formalism that combines adaptive features with discrete and real-time behaviour. We also propose a novel logic to express real-time requirements on adaptive systems, as well as algorithms to check a system against them. We implemented our method as part of PyECDAR, a model checker for timed systems.

show abstract

Model Checking Adaptive Software with Featured Transition Systems

Cited by 25 publications

References 42 publications

A White Box Perspective on Behavioural Adaptation

A White Box Perspective on Behavioural Adaptation

Adaptable Transition Systems

A framework for the rigorous design of highly adaptive timed systems

Contact Info

Product

Resources

About