Incomplete adaptive distinguishing sequences for non-deterministic FSMs

UC Türker, RM Hierons, G Barlas… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
The increasing complexity and criticality of software systems have led to growing interest in
automated test generation. One of the most promising approaches is to use model-based …

[HTML][HTML] State identification for labeled transition systems with inputs and outputs

P van den Bos, F Vaandrager - Science of Computer Programming, 2021 - Elsevier
Abstract For Finite State Machines (FSMs) a rich testing theory has been developed to
discover aspects of their behavior and ensure their correct functioning. Although this theory …

Deriving adaptive homing sequences for weakly initialized nondeterministic FSMs

E Vinarskii, A Tvardovskii, L Evtushenko… - 2019 IEEE East …, 2019 - ieeexplore.ieee.org
State identification sequences, such as homing and distinguishing sequences (HS and DS),
are widely used in FSM (Finite State Machine) based testing in order to reduce the size of a …

The effect of partiality and adaptivity on the complexity of FSM state identification problems

H Yenigun, N Yevtushenko, N Kushik… - Труды Института …, 2018 - cyberleninka.ru
State identification is a long standing problem in the area of Finite State Machine (FSM)
based modeling and testing of discrete event systems. For the identification of the current …

Incremental and heuristic approaches for deriving adaptive distinguishing test cases for non-deterministic finite-state machines

K El-Fakih, N Yevtushenko, A Saleh - The Computer Journal, 2019 - academic.oup.com
An incremental approach is proposed for deriving an adaptive Distinguishing Test Case
(DTC) for a subset of states of an observable non-deterministic Finite-State Machine (FSM) …

An approach for the verification and synthesis of complete test generation algorithms for finite state machines

R Sachtleben - 2022 - media.suub.uni-bremen.de
Complete test suites are of special interest in the field of model-based testing, as they
guarantee high fault detection capabilities under well-specified assumptions. The variety …

Evaluating length of a shortest adaptive homing sequence for weakly initialized FSMs

E Vinarskii, N Yevtushenko - 2020 IEEE East-West Design & …, 2020 - ieeexplore.ieee.org
There are many research papers devoted to the state identification problem of finite state
machines (FSMs) which are widely used for analysis of discrete event systems. A …

[PDF][PDF] Deriving adaptive distinguishing sequences for Finite State Machines

A Tvardovskii, N Yevtushenko - Trudy ISP RAN/Proc. ISP RAS, 2018 - academia.edu
(Finite State Machines) based testing for state identification and can significantly reduce the
size of a returned complete test. However, such sequences not always exist for deterministic …

К синтезу адаптивных различающих последовательностей для конечных автоматов

АС Твардовский, НВ Евтушенко - Труды Института системного …, 2018 - cyberleninka.ru
Конечные автоматы широко используются при построении проверяющих тестов для
управляющих систем с гарантированной полнотой обнаружения неисправностей. В …

State identification for labeled transition systems with inputs and outputs

P Bos, F Vaandrager - arXiv preprint arXiv:1907.11034, 2019 - arxiv.org
For Finite State Machines (FSMs) a rich testing theory has been developed to discover
aspects of their behavior and ensure their correct functioning. Although this theory is widely …