Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Sertaç Karahoda"'
An important concept in finite state machine based testing is synchronization which is used to initialize an implementation to a particular state. Usually, synchronizing sequences are used for this purpose and the length of the sequence used is impor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cf48d02c1c9dfc241788aeb03a340cb
https://aperta.ulakbim.gov.tr/record/8337
https://aperta.ulakbim.gov.tr/record/8337
Publikováno v:
Expert Systems with Applications. 167:114203
For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shorte
Publikováno v:
Testing Software and Systems ISBN: 9783319675480
ICTSS
ICTSS
Computing a shortest synchronizing word of an automaton is an NP–hard problem. Therefore, heuristics are used to compute short synchronizing words. SynchroP is among the best heuristics in the literature in terms of word lengths. The heuristic and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::add0a2f9310329bfc3529526fee19648
https://doi.org/10.1007/978-3-319-67549-7_15
https://doi.org/10.1007/978-3-319-67549-7_15
Publikováno v:
Testing Software and Systems ISBN: 9783319474427
ICTSS
ICTSS
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7303fc110d16f56ce72ce0339fbd04af
https://doi.org/10.1007/978-3-319-47443-4_7
https://doi.org/10.1007/978-3-319-47443-4_7