30 Years of Modal Transition Systems: Survey of Extensions and Analysis

Křetínský, Jan

doi:10.1007/978-3-319-63121-9_3

Cited by 14 publications

(11 citation statements)

References 156 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…to facilitate family-based model checking of properties expressed in a fragment of the variability-aware action-based and state-based branchingtime modal temporal logic v-ACTL and interpreted on so-called 'live' MTSs [5,[11][12][13]. A Modal Transition System (MTS) is an LTS that distinguishes admissible ('may'), necessary ('must'), and optional (may but not must) transitions such that by definition all necessary and optional transitions are also admissible [53,54].…”

Section: Usefulness Of Unambiguous Ftssmentioning

confidence: 99%

Static Analysis of Featured Transition Systems

Beek

Damiani

Lienhardt

et al. 2019

Proceedings of the 23rd International Systems and Software Product Line Conference - Volume A

View full text Add to dashboard Cite

A Featured Transition System (FTS) is a formal behavioural model for software product lines, which represents the behaviour of all the products of an SPL in a single compact structure by associating transitions with features that condition their existence in products. In general, an FTS may contain featured transitions that are unreachable in any product (so called dead transitions) or, on the contrary, mandatorily present in all products for which their source state is reachable (so called false optional transitions), as well as states from which only for certain products progress is possible (so called hidden deadlocks). In this paper, we provide algorithms to analyse an FTS for such ambiguities and to transform an ambiguous FTS into an unambiguous FTS. The scope of our approach is twofold. First and foremost, an ambiguous model is typically undesired as it gives an unclear idea of the SPL. Second, an unambiguous FTS paves the way for efficient family-based model checking. We apply our approach to illustrative examples from the literature. CCS CONCEPTS• Software and its engineering → Specification languages; Formal methods; Software product lines.

show abstract

Section: Usefulness Of Unambiguous Ftssmentioning

confidence: 99%

Static Analysis of Featured Transition Systems

Beek

Damiani

Lienhardt

et al. 2019

Proceedings of the 23rd International Systems and Software Product Line Conference - Volume A

View full text Add to dashboard Cite

show abstract

“…We assume ∆ must (s) to be nonempty for every state s. We call a Kripke structure K = (S, AP, ∆, init, λ) an implementation of M if ∆ must ⊆ ∆ ⊆ ∆ may . This is in contrast to other works in the modal transition system literature which usually consider a more general notions of implementation based on refinement relations (see [43] for a recent overview).…”

Section: Preliminariesmentioning

confidence: 85%

“…This is why we consider modal transition systems (MTS), in which there is another layer of choice: namely determining the subset of may transitions that are present in any state. Modal transition systems have been widely studied as a formalism to capture the refinement of processes from abstract specifications to concrete implementations [42], [43]. They have been extended in various ways, and the corresponding synthesis and verification problems have been considered [49]- [51].…”

Section: Importance Values In Ctlmentioning

confidence: 99%

Responsibility and verification: Importance value in temporal logics

Mascle¹,

Baier

Funkev

et al. 2021

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification. For this purpose, we apply the concept of Shapley values to verification as a means to evaluate how important a part of a system is. The importance of a component is measured by giving its control to an adversary, alone or along with other components, and testing whether the system can still fulfill the specification. We study this idea in the framework of modelchecking with various classical types of linear-time specification, and propose several ways to transpose it to branching ones. We also provide tight complexity bounds in almost every case.

show abstract

“…Different formal models have been proposed to capture the behavior of software product lines (SPLs), e.g., for model-based testing or model checking. Examples of such formal models include featured transition systems (FTSs) [1], modal transition systems (MTSs) [2] and various extensions thereof [3,4,5,6,7,8,9,10,11]. The expressive power of some of the aforementioned formalisms has been assessed in [12,13,14,15].…”

Section: Introductionmentioning

confidence: 99%

“…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

30 Years of Modal Transition Systems: Survey of Extensions and Analysis

Cited by 14 publications

References 156 publications

Static Analysis of Featured Transition Systems

Static Analysis of Featured Transition Systems

Responsibility and verification: Importance value in temporal logics

Modal transition system encoding of featured transition systems

Contact Info

Product

Resources

About