Testing Timed Finite State Machines with Guaranteed Fault Coverage

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.

[1]  Ferhat Khendek,et al.  Timed Wp-Method: Testing Real-Time Systems , 2002, IEEE Trans. Software Eng..

[2]  Farn Wang.  Formal Techniques for Networked and Distributed Systems - FORTE 2005, 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings , 2005, FORTE.

[3]  Nina Yevtushenko,et al.  Distinguing Non-deterministic Timed Finite State Machines , 2009, FMOODS/FORTE.

[4]  Alexandre Petrenko,et al.  Protocol testing: review of methods and relevance for software testing , 1994, ISSTA '94.

[5]  Nina Yevtushenko,et al.  An Improved Conformance Testing Method , 2005, FORTE.

[6]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[7]  Frits W. Vaandrager,et al.  Testing timed automata , 1997, Theor. Comput. Sci..

[8]  David Lee,et al.  Testing Finite State Machines: Fault Detection , 1995, J. Comput. Syst. Sci..

[9]  Mercedes G. Merayo,et al.  Formal testing from timed finite state machines , 2008, Comput. Networks.

[10]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[11]  Nina Yevtushenko,et al.  Nondeterministic State Machines in Protocol Conformance Testing , 1993, Protocol Test Systems.

[12]  Robert M. Hierons,et al.  Testing from a stochastic timed system with a fault model , 2009, J. Log. Algebraic Methods Program..

[13]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[14]  Alexandre Petrenko.  Checking Experiments with Protocol Machines , 1991, Protocol Test Systems.

[15]  Nina Yevtushenko,et al.  Testing from partial deterministic FSM specifications , 2005, IEEE Transactions on Computers.

[16]  Insup Lee,et al.  Resources in process algebra , 2007, J. Log. Algebraic Methods Program..

[17]  Rachel Cardell-Oliver,et al.  A Practical and Complete Algorithm for Testing Real-Time Systems , 1998, FTRTFT.

[18]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .

[19]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..