A protocol test generation procedure
Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Method of constructing a test experiment for an arbitrary deterministic automation
Automatic Control and Computer Sciences
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Protocol testing: review of methods and relevance for software testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Testing finite state machines: fault detection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
On Test Derivation from Partial Specifications
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Executable Test Sequence for the Protocol Data Flow Property
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
KVEST: Automated Generation of Test Suites from Formal Specifications
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Checking Experiments with Protocol Machines
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Checking Experiments ror Sequential Machines
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
Distinguing Non-deterministic Timed Finite State Machines
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
FSM-based conformance testing methods: A survey annotated with experimental evaluation
Information and Software Technology
Angluin style finite state machine inference with non-optimal counterexamples
Proceedings of the First International Workshop on Model Inference In Testing
Evaluating test suite characteristics, cost, and effectiveness of FSM-based testing methods
Information and Software Technology
| Hi-index | 0.00 |
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of a test suite based on a formal specification given in the form of a finite state machine. Well-known methods are called the W, Wp, UIO, UIOv, DS, H and HIS test derivation methods. These methods have been extensively used by research community in the last years; however no proper comparison has been made between them. In this paper, we experiment with these methods to assess their complexity, applicability, completeness, fault detection capability, length and derivation time of their test suites. The experiments are conducted on randomly generated specifications and on a realistic protocol called the Simple Connection Protocol.