Nested Commits for Mobile Calculi: Extending Join

ROBERTO BRUNI; HERNÁN MELGRATTI; UGO MONTANARI

Conferencia; IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004),; 2004

In global computing applications the availability of a mechanism for some formof committed choice can be useful, and sometimes necessary. It can convenientlyhandle, e.g., distributed agreements and negotiations with nested choice points.We propose a linguistic extension of the Join calculus for programming nestedcommits, called Committed Join (cJoin). It provides primitives for explicit abort,programmable compensations and interactions between negotiations. We givethe operational semantics of cJoin in the reflexive cham style. Then we discussits expressiveness on the basis of a few examples and encodings. Finally, weprovide a big-step semantics for cJoin processes that can be typed as shallowand we show that shallow processes are serializable.