What you can do is this. Split your interval into a number of subintervals of length delta.Each of these subintervals has a probability of moving to some of the other intervals or to the endpoints. This creates a descrete Markov process witha matrix of size NxN, with N = sigma/delta, or so. It may be difficult to work with general parameters, but I think that picking up some definite values may give you a good idea of what is happening in general.
Say, for beta = 1 and delta = 2/3, sigma = 3. You could consider 5 intervals [0, 2/3], [2/3, 4/3], [4/3, 6/3], [6/3, 8/3], [8/3, 3]. Call them I0, I1, ..., I4. Now write p(i, k) for the transition probability of moving from Ii to Ik.
Now, numbers below 4/9 remain in the 0th interval with probability 1. Those from 4/9 to 2/3 stay in that interval with probability 1/2 and move to the next interval with probability 1/2. So I would say that
P(0, 0) = 2/3 + 1/3·1/2 = 5/6.
2/3 here is the conditional probability for a point in the 0th interval to be less than 4/9.
p(0, 1) = 1/3·1/2 = 1/6.
And so on. There is a start-up costs but once the matrix has been calculated, all you'll have to do is to consider its powers.
The lengths in the subdivision need not be related to delta. Also, you can add one extra interval below 0 and one above sigma. I think this is a manageable, although, a non-trivial task.