MAccS: A Tool for Reachability by Design

Raclet, Jean-Baptiste

doi:10.1007/978-3-319-15317-9_12

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a part of the results, it is shown that FTSs with finite behavior are more expressive than plain MTSs with finite behavior (i.e., MTS without any additional constructs to express variability constraints), essentially because those plain MTSs cannot specify persistently exclusive behavior. However, the theory of MTSs has been extensively studied [10] and based on that, various tools have been developed to support their analysis [5,16,17,18,19,20]. In addition, MTSs enjoy many desirable formal properties such as inherent notions of semantic refinement being compatible with parallel composition, thus enabling compositional reasoning.…”

Section: Introductionmentioning

confidence: 99%

Modal transition system encoding of featured transition systems

Varshosaz

Luthmann

Mohr

et al. 2019

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Featured transition systems (FTSs) and modal transition systems (MTSs) are two of the most prominent and well-studied formalisms for modeling and analyzing behavioral variability as apparent in software product line engineering. On one hand, it is well-known that for finite behavior FTSs are strictly more expressive than MTSs, essentially due to the inability of MTSs to express logically constrained behavioral variability such as persistently exclusive behaviors. On the other hand, MTSs enjoy many desirable formal properties such as compositionality of semantic refinement and parallel composition. In order to finally consolidate the two formalisms for variability modeling, we establish a rigorous connection between FTSs and MTSs by means of an encoding of one FTS into an equivalent set of multiple MTSs. To this end, we split the structure of an FTS into several MTSs whenever it is necessary to denote exclusive choices that are not expressible in a single MTS. Moreover, extra care is taken when dealing with infinite behaviour: loops may have to be unrolled to accumulate FTS path constraints when encoding them into MTSs. We prove our encoding to be semanticpreserving (i.e., the resulting set of MTSs induces, up to bisimulation, the same set of derivable variants as their FTS counterpart) and to commute with modal refinement. We further give an algorithm to calculate a concise representation of a given FTS as a minimal set of MTSs. Finally, we present experimental results gained from applying a tool implementation of our approach to a collection of case studies.

show abstract