Deriving checking sequences for nondeterministic FSMs

Abstract

Труды ИСП РАН, том 26, вып. 6, 2014 г.. 111 Синтез

On-the-Fly Construction of Adaptive Checking Sequences for Testing Deterministic Implementations of Nondeterministic Specifications

“…In this paper, we reduce the limitation considered in the above papers about the use of resets. Moreover, differently from [6] we show how to effectively use adaptive transfer and distinguishing sequences when deriving an adaptive checking sequence as such adaptive sequences can exist when there are no preset ones; in addition, such adaptive sequences can be shorter [1] [17] [19]. More precisely, we construct an adaptive checking sequence from a given non-deterministic observable FSM against a given complete deterministic IUT assuming that the specification FSM has adaptive transfer sequences as well as an adaptive distinguishing sequence (a distinguishing test case) of reasonable length.…”

“…Resetting is still used yet only in one phase of the construction approach. Ermakov [6] presented a method for deriving an adaptive checking sequence with respect to the reduction relation under the assumption that the specification has a separating sequence, i.e., an input sequence for which the sets of output responses at any two different states are disjoint. The specification FSM has also to be deterministically connected, i.e., each state is deterministically reachable from any other state while an IUT is a complete deterministic FSM.…”

“…A checking sequence is adaptive if the selection of the next input to be applied to an IUT depends on the outputs produced by the IUT to previously applied inputs. As in the other above approaches, the approach given in [6] also uses resetting. In this paper, we reduce the limitation considered in the above papers about the use of resets.…”