Deriving homing sequences for Finite State Machines with timeouts
State identification is the well-known problem in the automata theory that is aimed to determining the current or initial state of a system under test and this fact is widely used in the model-based testing of software and hardware systems. When modern systems are modeled, it is necessary to take in...
| Published in: | The computer journal Vol. 66, № 9. P. 2181-2190 |
|---|---|
| Main Author: | Tvardovskii, Aleksandr |
| Other Authors: | Yevtushenko, Nina V. |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001007722 |
Similar Items
-
Conformance relations for finite state machines with timeouts
by: Kondratyeva, O. -
Deriving tests with guaranteed fault coverage for finite state machines with timeouts
by: Tvardovskii, Aleksandr -
Синтез установочных последовательностей для автоматов с таймаутами
by: Твардовский, Александр Сергеевич -
Adaptive experiments for state identification in finite state machines with timeouts
by: Tvardovskii, Aleksandr -
On the length of homing sequences for nondeterministic finite state machines
by: Kushik, Natalia G.
