Skip to main content

An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions

  • Conference paper
Coordination Models and Languages (COORDINATION 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2949))

Included in the following conference series:

Abstract

This paper presents the StAC language and its operational semantics. StAC (Structured Activity Compensation) is a business process modelling language and a distinctive feature of the language is its support for compensation. A compensation is an action taken to recover from error or cope with a change of plan, especially when rollback of a process is not possible. StAC is similar to a process algebraic language such as Hoare’s CSP or Milner’s CCS but has additional operators dealing with compensation and with exception handling. In this paper we present an operational semantics for the language.

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. Abrial, J.R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Bocchi, L., Laneve, C., Zavattaro, G.: A calulus for long-running transactions. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 124–138. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. 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 

  4. Chessell, M., Vines, D., Griffin, C.: An introduction to compensation with business process beans. Technical report, Transaction Processing Design and New Technology Development Group, IBM UK Laboratories (August 2001)

    Google Scholar 

  5. Chessell, M., Vines, D., Griffin, C., Butler, M., Ferreira, C., Henderson, P.: Extending the concept of transaction compensation. IBM Systems Journal 41(4), 743–758 (2002)

    Article  Google Scholar 

  6. Chessell, M., Vines, D., Griffin, C., Green, V., Warr, K.: Business process beans: System design and architecture document. Technical report, Transaction Processing Design and New Technology Development Group, IBM UK Laboratories (January 2001)

    Google Scholar 

  7. Curbera, F., Goland, Y., Klein, J., Leymann, F., Roller, D., Thatte, S., Weerawarana, S.: Business process execution language for web services, version 1.1, http://www-106.ibm.com/developerworks/library/ws-bpel/ (2003)

  8. Dijkstra, E.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  9. Ferreira, C.: Precise Modelling of Business Processes with Compensation. PhD thesis, University of Southampton (2002)

    Google Scholar 

  10. Ferreira, C., Butler, M.: Using B Refinement to Analyse Compensating Business Processes. In: Bert, D., Bowen, J.P., King, S. (eds.) ZB 2003. LNCS, vol. 2651, pp. 477–496. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (1993)

    MATH  Google Scholar 

  12. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  13. Jones, C.: Systematic Software Development Using VDM. Prentice-Hall, Englewood Cliffs (1986)

    MATH  Google Scholar 

  14. Korth, H., Levy, E., Silberschatz, A.: A formal approach to recovery by compensating transactions. In: 16th VLDB Conference, Brisbane, Australia (1990)

    Google Scholar 

  15. Metha, B., Levy, M., Meredith, G., Andrews, T., Beckman, B., Klein, J., Mital, A.: BizTalk Server 2000 Business Process Orchestration. IEEE Data Engineering Bulletin 24(1), 35–39 (2001)

    Google Scholar 

  16. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  17. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Inform. and Comput. 100(1), 1–40, 41–77 (1992)

    Google Scholar 

  18. Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department (September 1981)

    Google Scholar 

  19. Spivey, J.: The Z Notation. Prentice Hall, New York (1989)

    MATH  Google Scholar 

  20. Wachter, H., Reuter, A.: The ConTract model. In: Elmagarmid, A. (ed.) Database Transaction Models for Advanced Applications. Morgan Kaufmann Publishers, San Francisco (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Butler, M., Ferreira, C. (2004). An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions. In: De Nicola, R., Ferrari, GL., Meredith, G. (eds) Coordination Models and Languages. COORDINATION 2004. Lecture Notes in Computer Science, vol 2949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24634-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24634-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21044-3

  • Online ISBN: 978-3-540-24634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics