PROJECT TITLE :

Generating Complete Controllable Test Suites for Distributed Testing

ABSTRACT:

A take a look at suite is $m$ -complete for finite state machine (FSM) $M$ if it distinguishes between $M$ and all faulty FSMs with $m$ states or fewer. Whereas there are several algorithms that generate $m$ -complete take a look at suites, they can not be directly utilized in distributed testing since there will be extra controllability and observability problems. Indeed, previous results show that there is no general technique for generating an $m$ -complete check suite for distributed testing and therefore the focus has been on conditions underneath that this is often doable. This paper takes a different approach, which is to generate what we decision $c_m$ -complete test suites: controllable check suites that distinguish an FSM $N$ with no more than $m$ states from $M$ if this can be potential in controllable testing. Therefore, underneath the hypothesis that the system under take a look at has only $m$ states, a $c_m$ -complete take a look at suite achieves as a lot of as is doable given the restriction that testing ought to be controllable. We tend to show how the matter of generating a $c_m$ -complete test suite will be mapped to the matter of generating an $m$ -complete take a look at suite for a partial FSM. Thus, commonplace check suite generation strategies will be adapted to be used in distributed testing.