Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Theoretical Computer Science
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
Theoretical Computer Science
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Checking Experiments with Protocol Machines
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
A Practical and Complete Algorithm for Testing Real-Time Systems
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Testing from Partial Deterministic FSM Specifications
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
An improved conformance testing method
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A practical approach for testing timed deterministic finite state machines with single clock
Science of Computer Programming
| Hi-index | 0.00 |
A method is presented for deriving test suites with the guaranteed fault coverage for deterministic possibly partial Timed Finite State Machines (TFSMs). TFSMs have integer boundaries for time guards and the time reset operation at every transition; for TFSM implementations the upper bound on the number of states is known as well as the largest finite boundary and the smallest duration of time guards. We consider two fault models and present corresponding techniques for deriving complete test suites. In the first fault model inputs can be applied at integer time instances while in the second fault model time instances can be rational. The derivation method for integer time instances is extended to the case when the number of states of an implementation under test can be larger than the number of states of the given specification.