Skip to main content
SpringerLink
Log in

Failure-Divergence Refinement of Compensating Communicating Processes

  • Conference paper
FM 2011: Formal Methods (FM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6664))

Included in the following conference series:

Abstract

Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provides a complete solution to this problem and develops a theory of cCSP, corresponding to the theory of CSP, so that the verification techniques and their tools, such as FDR, can be extended for compensating processes.

Supported in parts by projects NSFC 60725206, National 973 project 2011CB302603, NSFC 60970031, NSFC 61073022, and the MSTDF project GAVES.

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

Access this chapter

Log in via an institution
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. 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)

    Chapter  Google Scholar 

  2. Bruni, R., Butler, M.J., Ferreira, C., Hoare, C.A.R., Melgratti, H.C., 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 

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

    Google Scholar 

  4. Butler, M.J., 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)

    Chapter  Google Scholar 

  5. Butler, M.J., Ferreira, C., Ng, M.Y.: Precise modelling of compensating business transactions and its application to BPEL. J. UCS 11(5), 712–743 (2005)

    Google Scholar 

  6. Butler, M.J., Hoare, C.A.R., Ferreira, C.: A trace semantics for long-running transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 133–150. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Butler, M., Ripon, S.: Executable semantics for compensating CSP. In: Bravetti, M., Kloul, L., Tennenholtz, M. (eds.) EPEW/WS-EM 2005. LNCS, vol. 3670, pp. 243–256. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. In: Necula, G.C., Wadler, P. (eds.) POPL, pp. 261–272. ACM, New York (2008)

    Google Scholar 

  9. Chen, Z., Liu, Z.: An Extended cCSP with Stable Failures Semantics. In: Cavalcanti, A., Deharbe, D., Gaudel, M.-C., Woodcock, J. (eds.) ICTAC 2010. LNCS, vol. 6255, pp. 121–136. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Chen, Z., Liu, Z., Wang, J.: A theory of failure-divergence refinement for long running transactions. Technical Report 447, UNU-IIST (2011), http://www.iist.unu.edu/www/docs/techreports/reports/report447.pdf

  11. Fischer, J., Majumdar, R.: Ensuring consistency in long running transactions. In: Proc. ASE 2007, pp. 54–63. ACM, New York (2007)

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  14. Little, M.C.: Transactions and web services. Commun. ACM 46(10), 49–54 (2003)

    Article  Google Scholar 

  15. Microsoft. Biztalk server, http://www.microsoft.com/biztalk/default.asp

  16. Ripon, S., Butler, M.J.: PVS embedding of cCSP semantic models and their relationship. Electr. Notes Theor. Comput. Sci. 250(2), 103–118 (2009)

    Article  MATH  Google Scholar 

  17. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall PTR, Upper Saddle River (1997)

    Google Scholar 

  18. Roscoe, A.W.: The three platonic models of divergence-strict CSP. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 23–49. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Laboratory for Parallel and Distributed Processing, Changsha, China

    Zhenbang Chen & Ji Wang

  2. International Institute for Software Technology, The United Nations University, Macao, China

    Zhiming Liu

Authors
  1. Zhenbang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiming Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ji Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Southampton, UK

    Michael Butler

  2. Microsoft Research, Redmond, WA, USA

    Wolfram Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z., Liu, Z., Wang, J. (2011). Failure-Divergence Refinement of Compensating Communicating Processes. In: Butler, M., Schulte, W. (eds) FM 2011: Formal Methods. FM 2011. Lecture Notes in Computer Science, vol 6664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21437-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21437-0_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21436-3

  • Online ISBN: 978-3-642-21437-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation