Abstract
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.
Research supported by the MSR Cambridge Project Network-Aware Programming and Interoperability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency, Control and Recovery in Database Systems. Addison-Wesley Longman, 1987.
G. Berry and G. Boudol. The chemical abstract machine. Theoret. Comput. Sci., 96(1):217–248, 1992.
R. Bruni, C. Laneve, and U. Montanari. Centralized and distributed orchestration of transactions in the join-calculus. Technical Report, University of Pisa. To appear. http://www.di.unipi.it/~bruni/publications/TRbis2002.ps.gz
R. Bruni and U. Montanari. Zero-safe nets, or transition synchronization made simple. Proc. of EXPRESS’97, vol. 7 of Elect. Notes in Th. Comput. Sci. Elsevier Science, 1997.
R. Bruni and U. Montanari. Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput., 156(1–2):46–89, 2000.
R. Bruni and U. Montanari. Transactions and zero-safe nets. Advances in Petri Nets: Unifying Petri Nets, vol. 2128 of Lect. Notes in Comput. Sci., pp. 380–426. Springer, 2001.
R. Bruni and U. Montanari. Zero-safe net models for transactions in linda. Proc. of ConCoord 2001, vol. 54 of Elect. Notes in Th. Comput. Sci., 2001.
M. Buscemi and V. Sassone. High-level Petri nets as type theories in the Join calculus. Proc. of FoSSaCS 2001, vol. 2030 of Lect. Notes in Comput. Sci., pp. 104–120. Springer, 2001.
A. Coratella, M. Felder, R. Hirsch, and E. Rodriguez. A framework for analyzing mobile transaction. Journal of Database Management, 12(13), 2001.
C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the Join calculus. Proc. of POPL’96, pp. 372–385. ACM Press, 1996.
C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. Proc. of CONCUR’96, vol. 1119 of Lect. Notes in Comput. Sci., pp. 406–421. Springer, 1996.
R. J. van Glabbeek and G. D. Plotkin. Configuration structures. Proc. of LICS’95, pp. 199–209. IEEE Computer Society Press, 1995.
J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
T. Hoare. A Model for Long-Running Transactions in XLANG. Preliminary draft, 2001.
B. Laskey and J. Parker. Microsoft biztalk server 2000: Building a reverse auction with biztalk orchestration, 2001. Microsoft Corporation. Available at [18].
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, 1985.
U. Roxburgh. Biztalk orchestration: Transactions, exceptions, and debugging, 2001. Microsoft Corporation. Available at [18].
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruni, R., Laneve, C., Montanari, U. (2002). Orchestrating Transactions in Join Calculus* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive