Parallelizing Heuristics for Generating Synchronizing Sequences
| Autor: | Hüsnü Yenigün, Sertaç Karahoda, Uraz Cengiz Türker, Osman Tufan Erenay, Kamer Kaya |
|---|---|
| Přispěvatelé: | Wotawa, Franz, Nica, Mihai, Kushik, Natalia |
| Rok vydání: | 2016 |
| Předmět: |
QA075 Electronic computers. Computer science
Sequence Finite-state machine Speedup Theoretical computer science Heuristic Computer science Synchronizing 020207 software engineering Context (language use) 02 engineering and technology 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing QA Mathematics State (computer science) Heuristics |
| Zdroj: | Testing Software and Systems ISBN: 9783319474427 ICTSS |
| Popis: | Synchronizing sequences are used in the context of finite state machine based testing in order to initialize an implementation to a particular state. The cubic complexity of even the fastest heuristic algorithms known in the literature to construct a synchronizing sequence can be a problem in practice. In order to scale the performance of synchronizing heuristics, some algorithmic improvements together with a parallel implementation of these heuristics are proposed in this paper. An experimental study is also presented which shows that the improved/parallel implementation can yield a considerable speedup over the sequential implementation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|