Sökning: onr:"swepub:oai:DiVA.org:hh-36431" >
Hardness of derivin...
Hardness of deriving invertible sequences from finite state machines
-
- Hierons, Robert M. (författare)
- Department of Computer Science, Brunel University London, Uxbridge, United Kingdom
-
- Mousavi, Mohammad Reza, 1978- (författare)
- Högskolan i Halmstad,Centrum för forskning om inbyggda system (CERES)
-
- Thomsen, Michael Kirkedal (författare)
- Department of Computer Science, University of Copenhagen, Copenhagen, Denmark
-
visa fler...
-
- Turker, Uraz Cengiz (författare)
- Computer Engineering, Faculty of Engineering, Gebze Technical University, Kocaeli, Turkey
-
visa färre...
-
(creator_code:org_t)
- 2017-01-11
- 2017
- Engelska.
-
Ingår i: SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science. - Heidelberg : Springer Berlin/Heidelberg. - 9783319519623 - 9783319519630 ; , s. 147-160
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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. © Springer International Publishing AG 2017.
Ämnesord
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Nyckelord
- Software testing
- Generation algorithm
- Input sequence
- NP Complete
- Optimisation problems
- PSPACE-complete
- Single input
- Test generation algorithm
- Unique input/output sequences
- Optimization
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas