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
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
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)
Checking Experiments with Protocol Machines
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
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
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Optimal strategies for testing nondeterministic systems
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
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
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
Test selection for a nondeterministic FSM
Computer Communications
An EFSM-based test generation for validation of SDL specifications
Proceedings of the 3rd international workshop on Automation of software test
On the synthesis of adaptive tests for nondeterministic finite state machines
Programming and Computing Software
Improving Fault-based Conformance Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Validation of SDL specifications using EFSM-based test generation
Information and Software Technology
Synthesis of distinguishing test cases for timed finite state machines
Programming and Computing Software
Adaptive testing of deterministic implementations specified by nondeterministic FSMs
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Validation of SDL-based architectural design models using communication-based coverage criteria
Information and Software Technology
Testing nondeterministic finite state machines with respect to the separability relation
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.00 |
The paper addresses the problem of conformance test generation from input/output FSMs that might be partially specified and nondeterministic. Two conformance relations are considered, quasi-reduction and quasi-equivalence. The former requires that in response to each input sequence defined in a specification FSM, a conforming implementation FSM produces only output sequences of the specification FSM, while the latter is stronger: a conforming implementation FSM must produce all of them and nothing else. For each relation, a test generation method is elaborated. The resulting tests are proven to be complete, i.e., sound and exhaustive, for a given bound on the number of states; they include as special cases checking experiments for deterministic FSMs.