Test Generation from Requirements
Let us first review the following two definitions of set products. The
product of two finite sets A and B, denoted as A × B, is defined as
follows:
"
×
#
= \
B
,
C
|
B
∈
"
,
C
∈
#
^ (2.1)
We need another set product in order to be able to generate minimal sets
of constraints. The onto set product operator, written as ⊗, is defined as
follows; For finite sets A and B, A ⊗ B is a minimal set of pairs (u,v)
such that u ∈ A,v ∈ B, and each element of A appears at least once as
u and each element of B appears at least once as v. Note that there are
several ways to compute A ⊗ B when both A and B contain two or more
elements.
Example 2.26: Let A ={t, =,> } and B ={f,<}. Using the defini-
tions of set product and the onto product, we get the f