Abstract
A timed extension of π-calculus with a transaction construct – the calculus Web π – is studied. The underlying model of Web π relies on networks of processes; time proceeds asynchronously at the network level, while it is constrained by the local urgency at the process level. Namely process reductions cannot be delayed to favour idle steps. The extensional model – the timed bisimilarity – copes with time and asynchrony in a different way with respect to previous proposals. In particular, the discriminating power of timed bisimilarity is weaker when local urgency is dropped. A labelled characterization of timed bisimilarity is also discussed.
Chapter PDF
References
Amadio, R.M., Castellani, I., Sangiorgi, S.: On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195(2), 291–324 (1998)
Andrews, T., et al.: Business Process Execution Language for Web Services. Version 1.1. Specification, BEA Systems, IBM Corp., Microsoft Corp., SAP AG, Siebel Systems (2003)
Berger, M.: Basic theory of reduction congruence for two timed asynchronous π-calculi. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 115–130. Springer, Heidelberg (2004)
Berger, M., Honda, K.: The two-phase commitment protocol in an extended pi-calculus. In: EXPRESS 2000: Proceedings of the 7th International Workshop on Expressiveness in Concurrency. ENTCS, vol. 39.1. Elsevier Science Publishers, Amsterdam (2000)
Bocchi, L., Laneve, C., Zavattaro, G.: A calculus for long running transactions. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 124–138. Springer, Heidelberg (2003)
Bruni, R., Laneve, C., Montanari, U.: Orchestrating transactions in join calculus. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 321–337. Springer, Heidelberg (2002)
Butler, M., Ferreira, C.: An operational semantics for StAC, a language for modelling long-running business transactions. In: De Nicola, R., Ferrari, G.-L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol. 2949, pp. 87–104. Springer, Heidelberg (2004)
Butler, M., Hoare, T., Ferreira, C.: A trace semantics for long-running transactions. In: Proceedings of 25 Years of CSP, London (2004)
Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language (WSDL 1.1). W3C Note (2001)
Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 844–855. Springer, Heidelberg (1998)
Honda, K., Tokoro, M.: On asynchronous communication semantics. In: Tokoro, M., Wegner, P., Nierstrasz, O. (eds.) ECOOP-WS 1991. LNCS, vol. 612, pp. 21–52. Springer, Heidelberg (1992)
Kavantzas, N., Olsson, G., Mischkinsky, J., Chapman, M.: Web Services Choreography Description Languages. Oracle Corporation (2003)
Leymann, F.: Web Services Flow Language (wsfl 1.0). Technical report, IBM Software Group (2001)
Little, M.: Web services transactions: Past, present and future. In: Proceedings of the XML Conference and Exposition, Philadelphia, USA (2003)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100(1), 1–77 (1992)
OASIS. Introduction to UDDI: Important features and functional concepts. Organization for the Advancement of Structured Information Standards (2004)
Thatte, S.: XLANG: Web services for business process design. Microsoft Corporation (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laneve, C., Zavattaro, G. (2005). Foundations of Web Transactions. In: Sassone, V. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2005. Lecture Notes in Computer Science, vol 3441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31982-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-31982-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25388-4
Online ISBN: 978-3-540-31982-5
eBook Packages: Computer ScienceComputer Science (R0)