<s>
In	O
computer	O
science	O
,	O
a	O
simulation	O
is	O
a	O
computation	O
of	O
the	O
execution	O
of	O
some	O
appropriately	O
modelled	O
state-transition	B-Application
system	I-Application
.	O
</s>
<s>
Symbolic	B-Application
simulation	I-Application
is	O
a	O
form	O
of	O
simulation	O
where	O
many	O
possible	O
executions	O
of	O
a	O
system	O
are	O
considered	O
simultaneously	O
.	O
</s>
<s>
Because	O
symbolic	B-Application
simulation	I-Application
can	O
cover	O
many	O
system	O
executions	O
in	O
a	O
single	O
simulation	O
,	O
it	O
can	O
greatly	O
reduce	O
the	O
size	O
of	O
verification	O
problems	O
.	O
</s>
<s>
Techniques	O
such	O
as	O
symbolic	B-Application
trajectory	I-Application
evaluation	I-Application
(	O
STE	O
)	O
and	O
generalized	O
symbolic	B-Application
trajectory	I-Application
evaluation	I-Application
(	O
GSTE	O
)	O
are	O
based	O
on	O
this	O
idea	O
of	O
symbolic	B-Application
simulation	I-Application
.	O
</s>
