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

Abstract

A method is proposed for deriving an adaptive checking sequence for a given deterministic implementation of a nondeterministic Finite State Machine (FSM) specification with respect to the reduction relation. The implementation is non-initialized, i.e., there is no reliable reset input. In order to obtain a sequence of reasonable length, in the proposed technique, we consider specifications with adaptive distinguishing test cases and adaptive transfer sequences. In fact, we show how under these considerations we can on-the-fly derive a checking sequence where the head part establishes the one-to-one correspondence between states of the implementation and the specification and if established the second part of the sequence is constructed for checking the one-toone correspondence between transitions of the implementation and a submachine of the specification FSM. The latter construction appropriately utilizes information from the first part to reach and check intended transitions.

FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts

“…Each sequence of the d-cover set is appended with the separating sequence  of the FSM S and every input that also is appended with the separating sequence . If an adaptive test suite is derived, an adaptive distinguishing sequence can be used instead of a separating sequence while d-transfer sequences can be replaced by adaptive transfer sequences (if they exist) [19]. Adaptive distinguishing (separating) and d-transfer sequences can be shorter then preset, and moreover, they exist more often.…”

“…An input sequence α is adaptive if the next input depends on the outputs of the FSM. Such an input sequence can be represented by an FSM called a test case [19]. At each state of a test case, either there are transitions for one input with all outputs or there are no transitions and in the latter case, a state is called terminal.…”

“…In this case, the corresponding trace from the initial state to a terminal state of an adaptive separating test case allows to determine what was a state of the FSM S before the experiment. If an adaptive sequence separates each pair of different states of the FSM S, then such a sequence is an adaptive separating sequence for the FSM S. A test case can also represent an adaptive sequence from the initial state of the FSM S to the state s if each input-output sequence of the test case from the initial to a terminal state is ended at state s [19,20]. In this case, state s is adaptively reachable from the initial state.…”

Testing Timed Nondeterministic Finite State Machines with the Guaranteed Fault Coverage

“…Состояния [10]. В тестовом примере в каждом состоянии определен переход либо только по одно-му входному символу со всеми выходными символами, либо не определён ни один переход (это состояние назовём терминальным).…”

“…Тестовый пример представляет адаптивную передаточную последовательность из начального состояния автомата A S (B) в состояние s, если каждая входо-выходная последовательность из начального в терминальное состояние тестового примера за-канчивается в состоянии s [10]. В этом случае состояние s адаптивно достижимо из начального состояния.…”