A protocol test generation procedure
Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Reset sequences for monotonic automata
SIAM Journal on Computing
The synchronization problem in protocol testing and its complexity
Information Processing Letters
On the generation of minimal-length conformance tests for communication protocols
IEEE/ACM Transactions on Networking (TON)
Test generation with respect to distributed interfaces
Computer Standards & Interfaces
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Test Generation for Multiple State-Table Faults in Finite-State Machines
IEEE Transactions on Computers
Automatic generation of efficient lexical processors using finite state techniques
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
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
A survey of communication protocol testing
Journal of Systems and Software
Modeling basic LOTOS by FSMs for conformance testing
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Fault Coverage of UIO-based Methods for Protocol Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Generating Tests for Control Portion of SDL Specifications
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Distributed testing without encountering controllability and observability problems
Information Processing Letters
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
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
Overcoming observability problems in distributed test architectures
Information Processing Letters
Detecting observability problems in distributed testing
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Test generation based on control and data dependencies within system specifications in SDL
Computer Communications
Reducing test sequence length using invertible sequences
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
Finite-state-machine-based conformance testing has been extensively studied in the literature in the context of centralized test architecture. With a distributed test architecture which involves multiple remote testers, the application of a test sequence may encounter controllability problems. This problem can be overcome by introducing additional external coordination messages exchanged among remote testers. Such an approach requires for extra resources for the communication among remote testers and sometimes suffers from unexpected delay. It is thus desirable to avoid the controllability problem by selecting suitable test sequences. However, this is not always possible. For some finite state machines, we cannot generate a test sequence without using external coordination messages and apply it without encountering controllability problems during testing. In this paper, we present sufficient and necessary conditions on a given finite state machine for constructing test sequences so that it does not involve external coordination messages and its application to the implementation under test is free from controllability problems.