Test Generation from Finite State Models

Question 1

Abstract representation of behavior exhibited by some systems. Derived from application requirements. Not all aspects of requirements can be specified (security, performance, etc.)

Answer 1

FSM

Question 2

Description of the status of a system that is waiting to execute a transition

Answer 2

State

Question 3

Set of actions to be executed when a condition is fulfilled or when an event is received

Answer 3

Transition

Question 4

Directed graph that contains nodes representing states and edges representing state transitions and output functions

Answer 4

State diagram

Question 5

Introduce the concepts of hierarchically nested states and orthogonal regions, while extending the notion of actions. Have the characteristics of both Mealy machines and Moore machines.

Answer 5

UML state machines

Question 6

Each state in M there exists a transition for each input symbol

Answer 6

Completely specified

Question 7

For each pair of states (qi, qj) there exists an input sequence that takes M from state qi to qj

Answer 7

Strongly connected

Question 8

Number of states in M is less than or equal to any other FSM equivalent to M

Answer 8

Minimal

Question 9

Passes a collection of tests derived from its specification

Answer 9

Conformance testing

Question 10

Set of all strings representing sub-paths, starting at the root, in the testing tree

Answer 10

Transition cover set

Question 11

Uses the characterization set W of distinguishing sequences as the basis to generate a test set for an IUT (Implementation Under Test)

Answer 11

W-Method

Question 12

Similar to W-method (tests are generated from a minimal, complete and connected FSM), but the size of the test set is often smaller

Answer 12

Partial W-Method

Question 13

Sequences finds transfer and operation errors only

Answer 13

Unique input/output