Please use this identifier to cite or link to this item:
|Title:||Distinguishing sequences for partially specified FSMs|
|Keywords:||Distinguishing Sequences (DSs);computational complexity;Adaptive and Preset DSs (ADSs/PDSs)|
|Citation:||LNCS: 62 - 76, 2014|
|Abstract:||Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for PDSs is PSPACE-complete. We also report on the results of experiments with benchmarks and over 8 * 106 PSFSMs. © 2014 Springer International Publishing.|
|Appears in Collections:||Mathematical Sciences|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.