[moca] expressive power of this class of processes...

["L.G. Meredith" <lgreg.meredith@xxxxxxxxx>]

All,

Consider the following class of processes.

P, Q         ::=                    0
                        (x)(x[z] | P | x(y).Q)<u>
                               (new x)P
                                     !P
where (x)(...)<u> represents an abstraction in x applied to the name u.

Claim: these processes cannot deadlock. Specifically, there is no race
to a state that results in starvation.

Has anyone studied these? Does anyone know the expressive power of this class? 

Best wishes,

--greg

-- 
L.G. Meredith
  
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
 http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html