Hardness of deriving invertible sequences from finite state machines

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

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.

OriginalsprogEngelsk
TitelSOFSEM 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
RedaktørerBernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria
Antal sider14
ForlagSpringer
Publikationsdato2017
Sider147-160
ISBN (Trykt)978-3-319-51962-3
ISBN (Elektronisk)978-3-319-51963-0
DOI
StatusUdgivet - 2017
Begivenhed43rd International Conference on Current Trends in Theory and Practice of Computer Science - Limerick, Irland
Varighed: 16 jan. 201720 jan. 2017
Konferencens nummer: 43

Konference

Konference43rd International Conference on Current Trends in Theory and Practice of Computer Science
Nummer43
LandIrland
ByLimerick
Periode16/01/201720/01/2017
NavnLecture notes in computer science
Vol/bind10139
ISSN0302-9743

ID: 179559810