Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/14072
Title: | Hardness of deriving invertible sequences from finite state machines |
Authors: | Hierons, RM Mousavi, MR Thomsen, MK Türker, UC |
Issue Date: | 2016 |
Publisher: | Springer Verlag |
Citation: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10139 LNCS pp. 147 - 160 |
Abstract: | © Springer International Publishing AG 2017.Many test generation algorithms use unique input/output sequences (UIOs) that identify states of the finite state machine specification M. However, it is known that UIO checking the existence of UIO sequences is PSPACE-complete. As a result, some UIO generation algorithms utilise what are called invertible sequences; these allow one to construct additional UIOs once a UIO has been found. We consider three optimisation problems associated with invertible sequences: deciding whether there is a (proper) invertible sequence of length at least K; deciding whether there is a set of invertible sequences for state set S′ that contains at most K input sequences; and deciding whether there is a single input sequence that defines invertible sequences that take state set S″ to state set S′. We prove that the first two problems are NP-complete and the third is PSPACE-complete. These results imply that we should investigate heuristics for these problems. |
URI: | http://bura.brunel.ac.uk/handle/2438/14072 |
DOI: | http://dx.doi.org/10.1007/978-3-319-51963-0_12 |
ISBN: | 9783319519623 |
ISSN: | 0302-9743 1611-3349 |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 345.87 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.