Deriving homing sequences for Finite State Machines with timeouts

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...

Full description

Bibliographic Details
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
LEADER 02227nab a2200301 c 4500
001 koha001007722
005 20231020163602.0
007 cr |
008 231012|2022 enk s a eng d
024 7 |a 10.1093/comjnl/bxac069  |2 doi 
035 |a koha001007722 
040 |a RU-ToGU  |b rus  |c RU-ToGU 
100 1 |a Tvardovskii, Aleksandr 
245 1 0 |a Deriving homing sequences for Finite State Machines with timeouts  |c A. Tvardovskii, N. V. Yevtushenko 
336 |a Текст 
337 |a электронный 
520 3 |a 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 into account the timed aspects and for this reason classical Finite State Machines (FSM) are extended by clock variables. In this work, we study the homing problem for FSMs with timeouts (TFSM). For this purpose, we introduce the notion of a timed homing sequence (HS) that is different from that for classical FSMs and propose a method for checking the existence and deriving a timed HS if it exists. A proposed method is based on the FSM abstraction of a TFSM, i.e. on a classical FSM that partially describes the behavior of a corresponding TFSM and inherits many of its properties. Since timeouts allow the system to move from state to state without input impact, we define a timed HS as a sequence that sets a TFSM to a stable state where the system can stay infinitely long waiting for an input. 
653 |a конечные автоматы с таймаутами 
653 |a установочные последовательности 
653 |a временные ограничения 
653 |a конечно-автоматная абстракция 
655 4 |a статьи в журналах 
700 1 |a Yevtushenko, Nina V. 
773 0 |t The computer journal  |d 2022  |g Vol. 66, № 9. P. 2181-2190  |x 0010-4620 
852 4 |a RU-ToGU 
856 4 |u http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001007722 
908 |a статья 
999 |c 1007722  |d 1007722 

Similar Items