🚀 go-pugleaf

I am looking for references which describe the various strategies and rules 
of thumb used in multiprocessor Occam implementations for 
(1)  Scheduling processes;
(2) Garbage collection of processes and channels that are no longer useful.

Do these rules of thumb find explicit expression in the (denotational or)
operational semantics of Occam? What semantic rules are the bases for the
associated transformations ? How do these relate with the equivalences
in the theoretical setting of Milner, Walker and Parrow's \pi-calculus
(Mobile processes), where channels are first-class values that can be
communicated.

Thanks,
Sanjiva			(sanjiva%oravax@wrath.cs.cornell.edu)