Re: [moca] all-you-can-eat calculi

["David Teller" <dtelle@xxxxxxxxxxx>]

I have been doing something similar in the Controlled Pi-Calculus :

we have

    (new x)(\del{x}.P | \del{x}.Q | .... \del{x}.Z)   -->* P|Q|...|Z

In this context, (new x) is the -- almost -- usual pi-calculus new, while
\del{x}.P is a finalizer for x. In other words, when x is
garbage-collected, P, Q ... Z are triggered. I believe this qualifies as a
natural form of "communication".

But this all-you-can-eat is one aspect I have planned to investigate
further, whenever I get a chance.

Be reading you,
   David

On Tue, 17 Aug 2004 16:20:19 +0100, Martin Berger <martinb@xxxxxxxxxxxxxx>  
wrote:

> most message passing calculi i know either do point-to-point
> communication or broadcasting. the latter means one output
> interacts with many inputs. i wonder about the 'dual'
> of broadcasting -- i call it "all-you-can-eat" -- where
> one input consumes as many outputs as possible in one go.
> all-you-can-eat in a calculus of pure synchronisation would
> probably have a reduction rule like
>
>     x.P | \overline{x} | ... \overline{x}  --->  P
>
> I'd like to know if calculi with this or similar rules
> have already been studied. in particular, i'd like to hear
> about applications where this form of communication
> is natural. I'd also wish to find out how to generalise
> all-you-can-eat to value passing.
>
> thanks, martin
>
>   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
> The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
>  http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html


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