Deriving Exhaustive Test Suits for Nondeterministic FSMs w.r.t. Non-separability Relation

On deriving test suites for nondeterministic finite state machines with time-outs

“…Like in work [7] devoted to the test suite derivation methods w.r.t. non separability relation for classical nondeterministic FSMs, in this work, we consider the traditional fault model, namely, the triple , where A is a specification TFSM, ~ is the non separa bility relation, and the fault domain ᑬ specifies all possible faults.…”

“…A test sequence is a By analogy with work [7], in this paper, we propose an algorithm for constructing an exhaustive test suite with the respect to the fault model 〈A, ~, Sub nd (MM)〉. For TFSMs, the modification of the algorithm pro posed in [7] consists in supplementing the truncated successor tree with branches marked by time outs, like 3: Until one of the following rules of the successor tree truncation is satisfied for each set Q kj ∈ Q k , j ≥ 0: 4: Rule 1: there exists an input symbol i sep such that, for each state q, ∈ Q kj , transition from q by the input symbol i sep is not determined; 7: Rule 2: there exists Q am ∈ Q a , a < k, such that Q kj ⊇ Q am ; 8: Rule 3: |Q kj | = 1 and the sequence that marks a path in the tree from the root to this node does not mark any other path in the tree; 9: Do: 10:…”

“…This relation is remarkable in that the testing does not require the fulfillment of "all weather condi tions"; i.e., it is not required to apply each test case until all possible output sequences in response to the given input sequence are observed. In practice, the ful fillment of this condition is difficult to ensure; there fore, test suites derivation with the use of the non sep arability relation is actual for models of nondetermin istic FSMs [5][6][7] and their modifications [3,4]. In this paper, an algorithm for constructing separating sequences for TFSMs with time outs is suggested.…”

“…These relations and their features are borrowed mainly from the FSM theory. The non separability relation [5][6][7] studied in this paper has also been originally introduced for FSMs, namely, for the FSMs with nondeterministic behavior. This relation is remarkable in that the testing does not require the fulfillment of "all weather condi tions"; i.e., it is not required to apply each test case until all possible output sequences in response to the given input sequence are observed.…”

“…Algorithm 2 is a modification of a similar algorithm for classical FSMs, which was suggested in [7]. Modifications are associated with specific features of the TFSM model with delays, namely, with transi tions under time delays.…”