Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Minimal cover-automata for finite languages
Theoretical Computer Science
IEEE Transactions on Software Engineering
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
On the Minimality of Finite Automata and Stream X-machines for Finite Languages
The Computer Journal
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Finite state based testing of P systems
Natural Computing: an international journal
QE modeling and test selection based on PNFSM
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
An empirical evaluation of P system testing techniques
Natural Computing: an international journal
Learning finite cover automata from queries
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and non-deterministic) FSMs. Most approaches for selecting a test suite from a non-deterministic FSM are based on state counting. Generally, the existing methods of testing from FSMs check that the implementation under test behaves as specified for all input sequences. On the other hand, in many applications, only input sequences of limited length are used. In such cases, the test suite needs only to establish that the IUT produces the specified results in response to input sequences whose length does not exceed an upper bound l. A recent paper devises methods for bounded sequence testing from deterministic FSM specifications. This paper considers the, more general, situation where the specification may be a non-deterministic FSM and extends state counting to the case of bounded sequences. The extension is not trivial and has practical value since the test suite produced may contain only a small fraction of all sequences of length less than or equal to the upper bound.