.png){kind=icon}
Return
Effective synchronizing algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.04.079.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The notion of a synchronizing sequence plays an important role in the model-based testing of reactive systems, such as sequential circuits or communication protocols. The main problem in this approach is to find the shortest possible sequence which synchronizes the automaton being a model of the system under test. This can be done with a synchronizing algorithm. In this paper we analyze the synchronizing algorithms described in the literature, both exact (with exponential runtime) and greedy (polynomial). We investigate the implementation of the exact algorithm and show how this implementation can be optimized by use of some efficient data structures. We also propose a new greedy algorithm, which relies on some new heuristics. We compare our algorithms with the existing ones, with respect to both runtime and quality aspect. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Circuit testing
Conformance testing
Synchronizing sequences
Synchronizing automata
Reset word
Synchronizing algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSaveShareSave
ShareSaveShareSaveShareSaveCaracterização físico-química e bioquímica do farelo de palma forrageira redonda (Opuntia ficus) utilizado na alimentação de ruminantes.png)
Pubvet
OAAI
PubvetIF0
OAAIShareSaveShareSave
View more