.png){kind=icon}
.png){kind=icon}
Return
Testing from partial deterministic FSM specifications
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2005.152.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of test generation from partially specified deterministic Finite State Machines (FSMs) that may have indistinguishable states and, thus, are not necessarily reduced (minimized). The known methods for checking experiments that are based on state identification are not applicable to unreduced machines. We propose the so-called State-Counting approach that is directly applicable to unreduced FSMs. The approach generalizes the idea of state identification in test generation methods for deterministic machines.
Keywords:
Finite State Machine
partially specified FSM
test generation
weak conformance testing
fault detection
state identification
checking experiment
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available