State identification of Finite State Machines with timeouts and timed guards

State identification of Finite State Machines with timeouts and timed guards

Tvardovskii A.S. (TSU, Tomsk, Russia)
Burdonov I.B. (ISP RAS, Moscow, Russia)
Yevtushenko N.V. (ISP RAS, Moscow, Russia; NRU HSE, Moscow, Russia)

Abstract

Homing and synchronizing sequences for Finite State Machines (FSM) with timeouts and timed guards are introduced. Such sequences are widely used in model based testing for test derivation as well as for FSM learning. Existence check and derivation of such sequences are based on a corresponding FSM abstraction of a timed machine, since such methods are well studied for classical FSMs.

Keywords

finite state machine (FSM); timed guards; timeouts; homing sequence; synchronizing sequence; FSM abstraction.

Edition

Proceedings of the Institute for System Programming, vol. 38, issue 4, part 2, 2026, pp. 7-22

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2026-38(4)-16

For citation

Tvardovskii A.S., Burdonov I.B., Yevtushenko N.V. State identification of Finite State Machines with timeouts and timed guards. Proceedings of the Institute for System Programming, vol. 38, issue 4, part 2, 2026, pp. 7-22 DOI: 10.15514/ISPRAS-2026-38(4)-16.

Full text of the paper in pdf (in Russian) Back to the contents of the volume