Please use this identifier to cite or link to this item:
|Title:||Generating minimum height ADSs for partially specified finite state machines|
|Keywords:||Model based testing;Finite state machines;Adaptive distinguishing sequence|
|Publisher:||Springer International Publishing|
|Citation:||Lecture Notes in Electrical Engineering, 363, pp. 171 - 179, ( 2016)|
|Abstract:||In earlier work, the problem of generating a preset distinguishing sequence from a finite state machine (FSM) was converted into a Boolean formulae to be fed into a SAT solver, with experiments suggesting that such approaches are required as the size of input alphabet grows. In this paper we extend the approach to the minimum height adaptive distinguishing sequence construction problem for partially specified FSMs (PSFMSs), which is known to be an NP- Hard problem. The results of experimentswith randomly generated PSFSMs and case studies from the literature show that SAT solvers can perform better than a previously proposed brute-force algorithm.|
|Appears in Collections:||Dept of Computer Science Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.