On 4/6/06, Assaf Arkin <[EMAIL PROTECTED]> wrote:
> There's one thing that takes a while to get used to. A pi-calculus process
> may reduce to nothing, but a BPEL process never reduces.

What then is the advantage that the complexity of pi-calculus brings
once a BPEL model is deployed to the runtime (after reduction
semantics in the model have already been expressed)?  Is it
performance, scalability, or ?

Bill

Reply via email to