.png){kind=icon}
Return
Accelerating Finite State Machine-Based Testing Using Reinforcement Learning
.png){kind=icon}
OA
AI
DOI：10.1109/TSE.2024.3358416.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Testing is a crucial phase in the development of complex systems, and this has led to interest in automated test generation techniques based on state-based models. Many approaches use models that are types of finite state machine (FSM). Corresponding test generation algorithms typically require that certain test components, such as reset sequences (RSs) and preset distinguishing sequences (PDSs), have been produced for the FSM specification. Unfortunately, the generation of RSs and PDSs is computationally expensive, and this affects the scalability of such FSM-based test generation algorithms. This paper addresses this scalability problem by introducing a reinforcement learning framework: the Q-Graph framework for MBT. We show how this framework can be used in the generation of RSs and PDSs and consider both (potentially partial) timed and untimed models. The proposed approach was evaluated using three types of FSMs: randomly generated FSMs, FSMs from a benchmark, and an FSM of an Engine Status Manager for a printer. In experiments, the proposed approach was much faster and used much less memory than the state-of-the-art methods in computing PDSs and RSs.
Keywords:
Finite state machines
reset sequences
state identification sequences
reinforcement learning
Q-value function
software engineering/software/program verification
software engineering/test design
software engineering/testing and debugging
Journal
IF:
5.6
Papers:
2.9K
Citations:
1.1W
Organization
View more organizations
Cited Papers
Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs
OAAI
OAAIShareSaveShareSaveManagement in a modified no-tillage corn–soybean–wheat rotation influences weed population and community dynamics.png)
Weed Science
Weed ScienceIF0
PREAI
ShareSaveShareSaveEfficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduceJOURNAL OF BIG DATAOAAI
JOURNAL OF BIG DATAIF6.4
OAAIShareSave View more