Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Selecting test sequences for partially-specified nondeterministic finite state machines
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
Computer networks (3rd ed.)
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
A Calculus of Communicating Systems
A Calculus of Communicating Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Test Derivation from Non-Deterministic Finite State Machines
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Generation of Adaptive Test Cases from Nondeterministic Finite State Models
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Distinguishing Tests for Nondeterministic Finite State Machines
IWTCS Proceedings of the IFIP TC6 11th International Workshop on Testing Communicating Systems
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Testing from Partial Deterministic FSM Specifications
IEEE Transactions on Computers
Studying the separability relation between finite state machines
Software Testing, Verification & Reliability
Coping with nondeterminism in network protocol testing
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Test selection for a nondeterministic FSM
Computer Communications
On the synthesis of adaptive tests for nondeterministic finite state machines
Programming and Computing Software
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
QE modeling and test selection based on PNFSM
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
| Hi-index | 0.00 |
In this paper, we propose a fault model and a method for deriving complete test suites for nondeterministic FSMs with respect to the separability relation. Two FSMs are separable if there exists an input sequence such that the sets of output responses of these FSMs to the sequence do not intersect. In contrast to the well-known reduction and equivalence relations, the separability relation can be checked when the «all weather conditions» assumption does not hold for a nondeterministic Implementation Under Test (IUT). A (complete) test suite derived from the given (nondeterministic) FSM specification using the separability relation can detect every IUT that is separable from the given specification after applying each test case only once. Two algorithms are proposed for complete test derivation without the explicit enumeration of all possible implementations. The first algorithm can be applied when the set of possible implementations is the set of all complete nondeterministic submachines of a given mutation machine. The second algorithm is applied when the upper bound on the number of states of an IUT is known.