Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Coordinating Business Transactions on the Web
IEEE Internet Computing
Orchestrating Transactions in Join Calculus
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Synchronous Multiparty Synchronizations and Transactions
Concurrency, Graphs and Models
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Atomic commit and negotiation in service oriented computing
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
This article points out a strong connection between process calculi and atomic commit. Process calculus rendezvous is an abstract semantics for atomic commitment. An implementation of process-calculus rendezvous is an atomic commit protocol. Thus, the traditional correctness properties for atomic commit are entailed by a bisimulation proof of a calculus implementation. Actually, traditional rendezvous as found in the pi calculus corresponds to just a special case of atomic commit called a binary cohesion. If we take the general case of atomic commit, this induces a richer form of calculus rendezvous similar to the join calculus [Fournet, C. and G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: Proceedings of POPL '96, ACM (1996), pp. 372-385. URL http://research.microsoft.com/~fournet/papers/reflexive-cham-join-calculus.ps]. As an extended example of the analogy between calculus and atomic commit, we use the induced calculus to reformulate an earlier 2PCP correctness result by Berger and Honda [Berger, M. and K. Honda, The two-phase commitment protocol in an extended pi-calculus, in: EXPRESS '00, Electronic Notes in Theoretical Computer Science 39 (2000). URL ftp://ftp.dcs.qmw.ac.uk/lfp/martinb/express00.ps.gz].