Model-Based Testing for Embedded Systems

228 Model-Based Testing for Embedded Systems

Definition 2. Let Φ and E be the finite set of nodes and arcs of CSG. Any sequence of nodes

(φ

1

,...,φ

k

) is called a communication sequence (CS) if (φ

i

, φ

i+1

)∈E, for i =1,...,k−1.

The function l (length) determines the number of nodes of a CS. In particular, if l (CS)=1,

then it is a CS of length 1, which denotes a single node of CSG. Let α and ω be the functions

to determine the initial and final invocation of a CS. For example, given a sequence CS =

(φ

1

,...,φ

k

), the initial and final invocation are α (CS)=φ

1

and ω (CS)=φ

k

, respectively.

A CS =(φ, φ



) of length 2 is called a communication pair (CP).

Definition ...