A protocol test generation procedure
Computer Networks and ISDN Systems
An improved protocol test generation procedure based on UIOS
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Computer networks (3rd ed.)
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
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
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Generalizing redundancy elimination in checking sequences
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Generating Checking Sequences for Partial Reduced Finite State Machines
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
New state-recognition patterns for conformance testing of finite state machine implementations
Computer Standards & Interfaces
On "Exploring alternatives for transition verification"
Journal of Systems and Software
| Hi-index | 0.00 |
If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence $\bar{D}$ , then there are methods that make use of $\bar{D}$ to construct checking sequences that are much shorter than the ones that would be constructed by using only the UIO sequences for M. The methods to applied when a distinguishing sequence exists, only make use of the distinguishing sequences. In this paper we show that, even if M has a distinguishing sequence $\bar{D}$, the UIO sequences can still be used together with $\bar{D}$ to construct shorter checking sequences.