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

[Uwe.Nestmann@xxxxxxx]

>>>>> "MB" == Martin Berger <martinb@xxxxxxxxxxxxxx> writes:

MB> i call it "all-you-can-eat" -- where one input consumes
MB> as many outputs as possible in one go.  

Do you mean "as many as available" or "as many as wanted"?

MB> all-you-can-eat in a calculus of pure synchronisation
MB> would probably have a reduction rule like

MB>     x.P | \overline{x} | ... \overline{x}  --->  P

"As many as available" is not expressed by this rule alone,
because it does not enforce it, but only enables it.


Apart from this, you may want to look into the (early?)
works on LOTOS, where they studied CSP-like multi-way
synchronization --- thus, when performing a step for a
particular channel, enforcing the joint execution of all
interactions on that channel that are currently enabled ---
also in their combination with value-passing, 
and IIRC also for the case of many senders.

== Uwe ==

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