Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/14072
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Mousavi, MR | - |
dc.contributor.author | Thomsen, MK | - |
dc.contributor.author | Türker, UC | - |
dc.date.accessioned | 2017-02-16T16:50:37Z | - |
dc.date.available | 2017-01-01 | - |
dc.date.available | 2017-02-16T16:50:37Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10139 LNCS pp. 147 - 160 | en_US |
dc.identifier.isbn | 9783319519623 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/14072 | - |
dc.description.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. | en_US |
dc.format.extent | 147 - 160 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.title | Hardness of deriving invertible sequences from finite state machines | en_US |
dc.type | Other | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/978-3-319-51963-0_12 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
pubs.publication-status | Published | - |
pubs.volume | 10139 LNCS | - |
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.