Hi Rafael,
Assuming you know 'a' and have observed the x's, you can get a posterior for V in closed form. Start by thinking of V as a 'staircase function', whose values have a multivariate normal distribution, and note that V' is approximately D*V, D being a finite difference matrix. Then you have a linear model of the form
x(t+1) | y ~ N(b + c(t) V, ...)
V ~ N(0, C)
, where the vector c(t) can be got from x(t), D and a, all of which are known constants. The posterior for staircase V is a multivariate normal, and then you can refine the staircase until it becomes a Gaussian process.
If you have 'a' unknown or the x's observed with uncertainty, you can either 1) model V as a GP or 2) model it as a series of basis functions (sinusoids or Chebyshev polynomials, say, but they don't necessarily have to be orthogonal) with unknown coefficients. Be ready for long runs if the x's are observed with uncertainty, as mixing can be atrocious. If you can cut some corners to get a closed-form posterior like above I strongly recommend it.
BTW you're right about the introductory MCMC examples in the GP user guide having a steep learning curve, I'll have to update it when I get the chance. However I think pymc/examples/gp/PyMCModel.py shouldn't be too hard to understand, have you checked it out?
I'd be interested to hear how you get on if you don't mind keeping us posted.
Anand