Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Synthesis of test experiments in some classes of automata
Automatic Control and Computer Sciences
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
Formal methods for test sequence generation
Computer Communications
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
Testing strategies for communicating FSMs
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
Test Generation for Multiple State-Table Faults in Finite-State Machines
IEEE Transactions on Computers
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
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
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)
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
A Method to Automate User Interface Testing Using Variable Finite State Machines
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines
Proceedings of the conference on Design, automation and test in Europe
Research: Construction of checking sequences based on characterization sets
Computer Communications
Towards Deriving Test Sequences by Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Controllable Test Cases for the Distributed Test Architecture
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Verdict functions in testing with a fault domain or test hypotheses
ACM Transactions on Software Engineering and Methodology (TOSEM)
Testing Timed Finite State Machines with Guaranteed Fault Coverage
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Bounded sequence testing from deterministic finite state machines
Theoretical Computer Science
Testing from X-machine specifications
Formal methods and testing
Checking experiments for stream X-machines
Theoretical Computer Science
FSM-based conformance testing methods: A survey annotated with experimental evaluation
Information and Software Technology
Iterative refinement of specification for component based embedded systems
Proceedings of the 2011 International Symposium on Software Testing and Analysis
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
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
FSM test translation through context
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Generating model-based test cases from natural language requirements for space application software
Software Quality Control
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
A study on the extended unique input/output sequence
Information Sciences: an International Journal
Testing and model-checking techniques for diagnosis
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
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
Evaluating test suite characteristics, cost, and effectiveness of FSM-based testing methods
Information and Software Technology
A practical approach for testing timed deterministic finite state machines with single clock
Science of Computer Programming
| Hi-index | 14.98 |
This paper addresses the problem of test generation from partially specified deterministic Finite State Machines (FSMs) that may have indistinguishable states and, thus, are not necessarily reduced (minimized). The known methods for checking experiments that are based on state identification are not applicable to unreduced machines. We propose the so-called State-Counting approach that is directly applicable to unreduced FSMs. The approach generalizes the idea of state identification in test generation methods for deterministic machines.