Studying the separability relation between finite state machines
Software Testing, Verification & Reliability
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Deriving Exhaustive Test Suits for Nondeterministic FSMs w.r.t. Non-separability Relation
ICSTW '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification, and Validation Workshops
Synthesis of distinguishing test cases for timed finite state machines
Programming and Computing Software
FSM-Based Test Derivation Strategies for Systems with Time-Outs
QSIC '11 Proceedings of the 2011 11th International Conference on Quality Software
| Hi-index | 0.00 |
In the paper, the non-separability relation for finite state machines with time-outs is studied. A specific feature of such machines is integer-valued delays, or time-outs, which determine how long the finite state machine will stay in one or another state if there are no input actions. If the time-out is over and no input symbol has been applied, then the TFSM state is changed according to the transition under time delay. In the paper, an algorithm for constructing a separating sequence for such finite state machines is presented. Here, the separating sequence is a timed input sequence for which sets of input sequences of the TFSM do not intersect; hence, it is sufficient to apply the separating sequence once in order to distinguish the TFSMs by their output reactions. This algorithm underlies the algorithm for construction of test suites with respect to non-separability relation in the case where the fault domain is specified by means of a mutation machine. Test suite derivation with respect to non-separability relation by way of "TFSM to FSM" transformation is discussed.