In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that can be produced by its specification machine in response to every input sequence. A method for deriving tests with respect to the reduction relation with full fault coverage for deterministic implementations is proposed based on certain properties of the product of specification and implementation machines.

No abstract

In this paper, we propose a generalized diagnostic algorithm for the case where more than one fault (output a d o r transfer) may be present in the transitions of a system represented by a deterministic finite state machine (FSM). If existing faults are detected, this algorithm permits the generation of a minimal set of diagnoses, each of which is formed by a set of transitions (with specific types of faults) suspected of being faulty. The occurrence in an implementation, of all the faults of a given diagnosis, allows the explanation of all observed implementation outputs. The algorithm guarantees the correct alagnosis of certain conjigurations of faults (output a d o r transfer) in an implementation, which are characterized by a certain type of independence of the different faults. We also propose an approach for selecting additional test cases, which allows the reduction of the number of possible diagnoses. A simple example is used to demonstrate the different steps of the algorithm

No abstract

No abstract