Hi Boaz:

let's assume we have an object O on which we want to run in another
machine a set of traversals determined by a strategy set St.
What is the smallest subobject of O so that all those traversals
will run correctly? Can we efficiently condense the 
strategy set St into a strategy
of the form "from A bypassing ... to *" which can be used for 
marshalling purposes? 

This approach allows us to compute the copy directives automatically
based on the software we want to run on the other side. Certainly
a step in the right direction. It should be possible to efficiently condense
the strategy set for a given class graph independent of a specific object.

-- Karl