Skip to main content

Algebraic Semantics for Compensable Transactions

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2007 (ICTAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4711))

Included in the following conference series:

Abstract

This paper presents the algebraic semantics of a novel transactional language t-calculus. This language focuses on modeling long running transactions in terms of compensable transactions, showing how the compensations can be orchestrated to ensure atomicity. The typical operators of sequential and parallel compositions are redefined so that the corresponding compensations will be activated in a suitable order whenever some failure occurs in later stage. In addition, we investigate more transactional operators, such as speculative choice, exception handling, alternative forwarding and programmable compensation. The wise use of these constructs is rather helpful to set up a flexible and effective business process. We present a clear algebraic semantics for t-calculus and derive its operational semantics mechanically based on a given derivation strategy. This work provides a foundation for optimization and implementation of this language.

Supported by National Basic Research Program of China (No. 2005CB321904) and Shanghai STCSM Project (No. 06JC14058).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garcia-Molina, H., Salem, K.: Sagas. In: Proc. of ACM SIGMOD 1987, pp. 249–259. ACM Press, New York (1987)

    Chapter  Google Scholar 

  2. Li, J., Zhu, H., Pu, G., He, J.: Looking into compensable transactions. In: SEW-31, IEEE Computer Society Press, Los Alamitos (to appear, 2007)

    Google Scholar 

  3. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  4. Plotkin, G.D.: A structural approach to operational semantics. Technical report, Aarhus University (1981)

    Google Scholar 

  5. Pu, G., Zhu, H., Qiu, Z., Wang, S., Zhao, X., He, J.: Theoretical foundations of scope-based compensable flow languange for web service. In: Gorrieri, R., Wehrheim, H. (eds.) FMOODS 2006. LNCS, vol. 4037, pp. 251–266. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Zhu, H., Pu, G., He, J.: A detational approach to scope-based compensable flow language for web services. In: Proc. of ASIAN 2006 (2006)

    Google Scholar 

  7. He, J., Zhu, H., Pu, G.: A model for BPEL-like languages. Frontiers of Computer Science in China (2006)

    Google Scholar 

  8. Li, J., He, J., Pu, G., Zhu, H.: Towards the semantics for web service choreography description language. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 246–263. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Li, J., He, J., Zhu, H., Pu, G.: Modeling and verifying web services choreography using process algebra. In: SEW-31, IEEE Computer Society Press, Los Alamitos (to appear, 2007)

    Google Scholar 

  10. Butler, M., Ferreira, C.: A process compensation language. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol. 1945, pp. 61–76. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. 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)

    Google Scholar 

  12. Butler, M., Hoare, T., Ferreira, C.: A trace semantics for long-running transaction. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) CSP 2004. LNCS, vol. 3525, pp. 133–150. Springer, Heidelberg (2005)

    Google Scholar 

  13. Butler, M., Ripon, S.: Executable semantics for compensating CSP. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) Formal Techniques for Computer Systems and Business Processes. LNCS, vol. 3670, pp. 243–256. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Bruni, R., Melgratti, H., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 2005, pp. 209–220. ACM Press, New York (2005)

    Chapter  Google Scholar 

  15. Bruni, R., Butler, M., Ferreira, C., Hoare, T., Melgratti, H., Montanari, U.: Comparing two approaches to compensable flow composition. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 383–397. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Cliff B. Jones Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, J., Zhu, H., He, J. (2007). Algebraic Semantics for Compensable Transactions. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75292-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75290-5

  • Online ISBN: 978-3-540-75292-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics