A protocol test generation procedure
Computer Networks and ISDN Systems
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
Reduced Length Checking Sequences
IEEE Transactions on Computers
Optimizing the Length of Checking Sequences
IEEE Transactions on Computers
A Method for the Design of Fault Detection Experiments
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Generalizing redundancy elimination in checking sequences
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Eliminating redundant tests in a checking sequence
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
New state-recognition patterns for conformance testing of finite state machine implementations
Computer Standards & Interfaces
| Hi-index | 0.00 |
A number of methods have been published to construct checking sequences for testing from Finite State Machine-based specifications. Many of these methods require the existence of a preset distinguishing sequence in the model. In this paper, we show that usually an adaptive distinguishing sequence is sufficient for these methods to work. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones.