A Decade of Featured Transition Systems

Cordy, Maxime; Devroey, Xavier; Legay, Axel; Perrouin, Gilles; Classen, Andreas; Heymans, Patrick; Schobbens, Pierre‐Yves; Raskin, Jean François

doi:10.1007/978-3-030-30985-5_18

Cited by 17 publications

(12 citation statements)

References 79 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be worthwhile to investigate the introduction of nondeterminism aspects typical of Markov decision processes. The non-deterministic transitions could be labeled with Boolean formulae, similar to the feature expressions that label the transitions of featured transition systems [14,15]. This would allows us to consider different kind of problems such as that of synthesizing the best attacker or to formulate statements like "all attackers with feature A satisfy a given property".…”

Section: Vision and Roadmapmentioning

confidence: 99%

“…This is problematic as attack scenarios must be evaluated on concrete systems, which are reacting in a dynamic defense manner to successive and ordered attack steps. In order to mitigate this problem, we combine attack trees with a behavioral model, just like feature diagrams have been combined with featured transition systems [14,15]. More precisely, the graphical security model for quantitative security modeling we propose here is based on declarative attributed attack-defense trees [21,22] to model the structure and properties (in the form of attributes) of vulnerabilities, defenses and countermeasures on the one hand, and on procedural probabilistic models [1,4,13,26,31] to capture attack behavior, modeling resource constraints and attack effectiveness, on the other hand.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Variability meets security

Beek

Legay

Lafuente³

et al. 2020

Proceedings of the 14th International Working Conference on Variability Modelling of Software-Intensive Systems

Self Cite

View full text Add to dashboard Cite

 Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Section: Vision and Roadmapmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Variability meets security

Beek

Legay

Lafuente³

et al. 2020

Proceedings of the 14th International Working Conference on Variability Modelling of Software-Intensive Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…A Featured Transition System (FTS) is a formal model with variability for capturing the behaviour of all products of an SPL in one compact model (Classen et al 2013;Cordy et al 2019); its action-labelled transitions are associated with features that condition their presence in product behaviour. Proving correctness of such models through model checking or testing is challenging.…”

Section: Introductionmentioning

confidence: 99%

Efficient static analysis and verification of featured transition systems

et al. 2021

View full text Add to dashboard Cite

A Featured Transition System (FTS) models the behaviour of all products of a Software Product Line (SPL) in a single compact structure, by associating action-labelled transitions with features that condition their presence in product behaviour. It may however be the case that the resulting featured transitions of an FTS cannot be executed in any product (so called dead transitions) or, on the contrary, can be executed in all products (so called false optional transitions). Moreover, an FTS may contain states from which a transition can be executed only in some products (so called hidden deadlock states). It is useful to detect such ambiguities and signal them to the modeller, because dead transitions indicate an anomaly in the FTS that must be corrected, false optional transitions indicate a redundancy that may be removed, and hidden deadlocks should be made explicit in the FTS to improve the understanding of the model and to enable efficient verification—if the deadlocks in the products should not be remedied in the first place. We provide an algorithm to analyse an FTS for ambiguities and a means to transform an ambiguous FTS into an unambiguous one. The scope is twofold: an ambiguous model is typically undesired as it gives an unclear idea of the SPL and, moreover, an unambiguous FTS can efficiently be model checked. We empirically show the suitability of the algorithm by applying it to a number of benchmark SPL examples from the literature, and we show how this facilitates a kind of family-based model checking of a wide range of properties on FTSs.

show abstract

“…Authors reserve their rights to disseminate the work on their personal and corporate Web sites with the appropriate attribution. https://doi.org/10.5281/zenodo.4497888 transition system [26,29]; its transitions, labelled with actions, are associated with features that condition their presence in classical Labelled Transition Systems (LTSs) that model individual variant behaviour. Proving correctness of such behavioural models through model checking or testing is challenging.…”

Section: Introductionmentioning

confidence: 99%

Static analysis and family-based model checking of featured transition systems with VMC

Beek

Mazzanti

Damiani

et al. 2021

Proceedings of the 25th ACM International Systems and Software Product Line Conference - Volume B

View full text Add to dashboard Cite

A Featured Transition System (FTS) is a formalism for modelling variability in configurable systems, such as software product lines. The behaviour of all variants (products) is modelled in a single compact FTS by associating the possibility to perform an action and transition from one state to another with features that condition the execution of an action in specific variants. We present a front-end tool for the Variability Model Checker VMC such that the resulting toolchain allows a modeller to analyse an FTS for ambiguities (dead or false optional transitions and hidden deadlock states), transform an ambiguous FTS into an unambiguous one, and perform an efficient kind of family-based model checking of an FTS without hidden deadlock states. We use examples from the literature to illustrate the novelties offered by the toolchain. CCS CONCEPTS• Software and its engineering → Software product lines; Formal methods; Model checking; Automated static analysis.

show abstract

A Decade of Featured Transition Systems

Cited by 17 publications

References 79 publications

Variability meets security

Variability meets security

Efficient static analysis and verification of featured transition systems

Static analysis and family-based model checking of featured transition systems with VMC

Contact Info

Product

Resources

About