Centralized and distributed orchestration of transactions in the join calculus

We discuss the principles of distributed transactions, then we define an operational model which meets the basic requirements and we give a prototyping implementation for it in join-calculus. Our model: (1) extends BizTalk with multiway transactions; (2) exploits an original algorithm, for distributed commit; (3) can deal with dynamically changing communication topology; (4) is almost language-independent. In fact, the model is based on a two-level classification of resources, which should be easily conveyed to distributed calculi and languages, providing them with a uniform transactional mechanism.

[1]  Roberto Bruni,et al.  Transactions and Zero-Safe Nets , 2001, Unifying Petri Nets.

[2]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[4]  P. Bernstein.  RRENCY CONTROL AND RECOVERY IN DATABASE SYSTEMS , 1998 .

[5]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[6]  Vladimiro Sassone,et al.  High-Level Petri Nets as Type Theories in the Join Calculus , 2001, FoSSaCS.

[7]  Roberto Bruni,et al.  Zero-safe net models for transactions in Linda , 2001, Electron. Notes Theor. Comput. Sci..

[8]  Miguel Felder,et al.  A Framework for Analyzing Mobile Transaction Models , 2001, J. Database Manag..

[9]  Roberto Bruni,et al.  Orchestrating Transactions in Join Calculus , 2002, CONCUR.

[10]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[11]  Roberto Bruni,et al.  Zero-safe nets, or transition synchronization made simple , 1997, EXPRESS.

[12]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

[13]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.