Information Technology Reference
In-Depth Information
P transformation
QS(
f,t
i
)
¼
QS(f,t
i
,t
i+1
)
P
1
<
l
j
,std>
¼
<
l
j
,
std>
P
2
<
l
j
,std>
¼
<(
l
j
,
l
j
+1
),inc>
P
3
<
l
j
,std>
¼
<(
l
j
-1
,
l
j
),dec>
P
4
<
l
j
,inc>
¼
<(
l
j
,
l
j
+1
),inc>
P
5
<(
l
j
,
l
j
+1
),inc>
¼
<(
l
j
,
l
j
+1
),inc>
P
6
<
l
j
,dec>
¼
<(
l
j
-1
,
l
j
),dec>
P
7
<(
l
j
,
l
j
+1
),dec>
¼
<(
l
j
,
l
j-
1
),dec>
I transformation
QS(f,t
i
,t
i+1
)
¼
QS(
f,t
i
+1
)
I
1
<
l
j
,std>
¼
<
l
j
,std>
I
2
<(
l
j
,l
j
+1
),inc>
¼
<
l
j
+1
,std>
I
3
<(
l
j
,l
j
+1
),inc>
¼
<
l
j
+1
,inc>
I
4
<(
l
j
,l
j
+1
),inc>
¼
<(
l
j
,l
j
+1
),inc>
I
5
<(
l
j
,l
j
+1
),dec>
¼
<
l
j
,std>
I
6
<(
l
j
,l
j
+1
),dec>
¼
<
l
j
,dec>
I
7
<(
l
j
,l
j
+1
),dec>
¼
<(
l
j
,l
j
+1
),dec>
*
,std>
I
8
<(
l
j
,l
j
+1
),inc>
¼
<
l
*
,std>
I
9
<(
l
j
,l
j
+1
),dec>
¼
<
l
Among them
*
is the new landmark value,
*
<
l
l
j
<
l
l
j+1
.
4.5.2
QSIM algorithm
QSIM algorithm can simulate the system behaviors. Send the initial state into
ACTIVE table at first, then repeat (1)
—
(6) until ACTIVE table is empty.
Algorithm 4.1
QSIM algorithm
1. Choose one state from ACTIVE table.
2. For each parameter, find all possible transformation according to the transformation
table.
3. Create set of binary group and ternary group according to the constraint variable
transformation and make consistent filtering according to constraint relationship.
4. Combine tuples according to the public variable constraint, then make consistent
filtering to the combined tuples.
5. Generate all the possible public explanation from the residual tuples. Each explanation
generates a new state as the subsequent state of the current state.
