0 Daumen
208 Aufrufe

Hellosc.PNG ,

the exercise: a) Write down the shortest sequence of stimuli/actions for state coverage. b) Write down the shortest sequence of stimuli/actions for transition coverage. c) How would the sequence of stimuli/actions for minimal loop coverage look like in this state chart and why?

I have to do state, transition and minimal loop coverage for the given State chart. Described as follows: state coverage: traverse each state, transition cov.: traverse each transition, min. loop cov.: acyclic paths + traverse each loop once.

So my first question is do I have to end in an end state for the coverages? For example for state cov: start() d.log(D) c.call() goOn() back() d.log(D) b.method is a given solution but do I really have to go back to state S1 only because the process ends there?

Same goes for transition coverage: could be a solution: loop() start()/d.log(D) c.call() goON() back()/d.log(D) b.method() skip()/c.call() back()/d.log(D) b.method() or loop() start()/d.log(D) c.call() goON() back()/d.log(D) b.method() skip()/c.call() without going back to final state

And for the minimal loop coverage Im really not sure what I could write down.

Thanks for the help!

Avatar von

Ein anderes Problem?

Stell deine Frage

Willkommen bei der Stacklounge! Stell deine Frage einfach und kostenlos

x
Made by a lovely community