Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/13077
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Turker, UC | - |
dc.date.accessioned | 2016-08-11T15:19:20Z | - |
dc.date.available | 2016-08-11T15:19:20Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Computer Journal, 2016 | en_US |
dc.identifier.issn | 1460-2067 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/13077 | - |
dc.identifier.uri | http://comjnl.oxfordjournals.org/content/early/2016/09/10/comjnl.bxw069 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Oxford University Press (OUP) | - |
dc.subject | Finite state machine | en_US |
dc.subject | Distributed test architecture | en_US |
dc.subject | Preset distinguishing sequence | en_US |
dc.title | Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1093/comjnl/bxw069 | - |
dc.relation.isPartOf | The Computer Journal | - |
pubs.publication-status | Accepted | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | 747.09 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.