Hardness of deriving invertible sequences from finite state machines

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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.

Original languageEnglish
Title of host publicationSOFSEM 2017: Theory and Practice of Computer Science : 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings
EditorsBernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria
Number of pages14
PublisherSpringer
Publication date2017
Pages147-160
ISBN (Print)978-3-319-51962-3
ISBN (Electronic)978-3-319-51963-0
DOIs
Publication statusPublished - 2017
Event43rd International Conference on Current Trends in Theory and Practice of Computer Science - Limerick, Ireland
Duration: 16 Jan 201720 Jan 2017
Conference number: 43

Conference

Conference43rd International Conference on Current Trends in Theory and Practice of Computer Science
Nummer43
LandIreland
ByLimerick
Periode16/01/201720/01/2017
SeriesLecture notes in computer science
Volume10139
ISSN0302-9743

ID: 179559810