Name
Abstract | ||
|---|---|---|
Homing and synchronizing sequences are used for the current state identification in finite state machines (FSMs). Adaptive homing and synchronizing sequences for which the next input depends on the outputs to the previous ones, exist more often and usually are shorter than the preset. Thus, a lot of attention is paid to the existence check, derivation complexity and length of shortest adaptive state identification sequences. In this paper, we adapt the notions of adaptive homing and synchronizing sequences for FSMs with timeouts which are widely used for solving verification and testing problems of components of telecommunication systems. Based on the corresponding FSM abstraction, the procedures for deriving adaptive homing and synchronizing sequences are proposed for FSMs with timeouts when such sequences exist. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/978-3-031-13502-6_12 | Machines, Computations, and Universality |
Keywords | DocType | Volume |
Finite state machines, Timeouts, Homing sequence, Synchronizing sequence | Conference | 13419 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tvardovskii Aleksandr | 1 | 0 | 0.34 |
| Nina Yevtushenko | 2 | 664 | 63.45 |