University of Leicester
Browse
FullText.pdf (747.09 kB)

Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences

Download (747.09 kB)
journal contribution
posted on 2020-04-08, 14:03 authored by Robert M Hierons, Uraz Cengiz Türker

There has been long-standing interest in automatically generating test sequences from a finite state machine (FSM) and more recently this has been extended to the case where there are multiple physically distributed testers and so we are testing from a multi-port FSM. This paper explores the problem of generating a controllable preset distinguishing sequence (PDS) from a multi-port FSM, motivated by the fact that many FSM-based test generation algorithms use PDSs. We prove that it is generally undecidable whether a multi-port FSM has a controllable PDS but provide a class of multi-port FSMs for which the problem is decidable. We also consider the important case where there is an upper bound on the length of PDSs of interest, proving that controllable PDS existence is PSPACE-hard and in EXPSPACE. In practice the upper bound is likely to be a polynomial in terms of the size of the multi-port FSM and in this case controllable PDS existence is NP-Complete.

History

Citation

Robert M. Hierons, Uraz Cengiz Türker, Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences, The Computer Journal, Volume 60, Issue 1, January 2017, Pages 110–125, https://doi.org/10.1093/comjnl/bxw069

Version

  • AM (Accepted Manuscript)

Published in

The Computer Journal

Volume

60

Issue

1

Pagination

110 - 125

Publisher

Oxford University Press (OUP)

issn

0010-4620

eissn

1460-2067

Copyright date

2017

Available date

2017-01-23

Publisher version

https://academic.oup.com/comjnl/article-abstract/60/1/110/2608068

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC