Skip to Main content Skip to Navigation
Conference papers

Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences

Abstract : For Finite State Machine (FSM) based testing, it has been shown that the use of shorter Adaptive Distinguishing Sequences (ads) yields shorter test sequences. It is also known, on the other hand, that constructing a minimum cost ADS is an NP-hard problem and it is NP-hard to approximate. In this paper, we introduce a lookahead-based greedy algorithm to construct reduced ADSs for FSMs. The greedy algorithm inspects a search space to make a decision. The size of the search space is adjustable, allowing a trade-off between the quality and the computation time. We analyse the performance of the approach on randomly generated FSMs by comparing the ADSs constructed by our algorithm with the ADSs that are computed by the existing algorithms.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 29, 2016 - 4:39:05 PM
Last modification on : Tuesday, November 29, 2016 - 4:48:50 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:24:16 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Uraz Cengiz Türker, Tonguç Ünlüyurt, Hüsnü yenigün. Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences. 26th IFIP International Conference on Testing Software and Systems (ICTSS), Sep 2014, Madrid, Spain. pp.32-47, ⟨10.1007/978-3-662-44857-1_3⟩. ⟨hal-01405273⟩



Record views


Files downloads