  In order to approximate the exit time of a one-dimensional diffusion process,
we propose an algorithm based on a random walk. Such an algorithm so-called
Walk on Moving Spheres was already introduced in the Brownian context. The aim
is therefore to generalize this numerical approach to the Ornstein-Uhlenbeck
process and to describe the efficiency of the method.
