Skip to main content
SpringerLink
Log in

A CSP model with flexible parallel termination semantics

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

In the original failure-divergence semantic model for Communicating Sequential Processes (CSP), the incomplete treatment of successful process termination, and in particular parallel termination, permitted unnatural processes to be defined. In response to these problems, a number of different solutions have been proposed by various authors since the original failure-divergence model was developed by Hoare, Brookes and Roscoe. This paper presents an alternative solution to this problem, which is both closer to the original semantic model and provides greater flexibility over the type of parallel termination semantics available in CSP.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aceto L, Hennessy M (1992) Termination, deadlock, and divergence. J ACM 39(1): 147–187

    Article  MATH  MathSciNet  Google Scholar 

  2. Brookes SD, Hoare CAR, Roscoe AW (1985) A theory of communicating sequential processes. J ACM 31(7)

  3. Brookes SD, Roscoe AW (1985) An improved failures model for communicating sequential processes. In: Proceedings of Pittsburgh Seminar on Concurrency, LNCS , vol 197. Springer, Heidelberg, pp 281–305

  4. Brookes SD (1983) A model for communicating sequential processes. Ph.D. Thesis, Oxford University, Oxford

  5. Baeten JCM, Weijland WP (1990) Process algebra. Cambridge tracts in theoretical computer science, vol 18. Cambridge University Press, London

    Google Scholar 

  6. Cavalcanti ALC,Woodcock JCP (2006) A tutorial introduction to CSP in unifying theories of programming. In: Refinement techniques in software engineering. Lecture Notes in Computer Science, vol. 3167. Springer, Heidelberg, pp 220–268

  7. Davies J (1993) Specification and proof in Real-Time systems. Cambridge University Press, London

    Google Scholar 

  8. Davies J, Schneider S (1989) An introduction to timed CSP. Technical monograph PRG-75, Programming Research Group. Oxford University, Oxford

    Google Scholar 

  9. Davies J, Schneider S (1992) A brief history of timed CSP. Technical Monograph PRG-96, Programming Research Group. Oxford University, Oxford

    Google Scholar 

  10. Formal Systems (Europe) Ltd. Failure-divergence refinement: FDR2 Manual. Oxford, UK (2003)

  11. Hoare CAR, He Jifeng (1998) Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  12. Hoare CAR (1985) Communicating sequential processes. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  13. Howells P (2005) Communicating sequential processes with flexibile parallel termination semantics. Ph.D. Thesis, University of Westminster

  14. Milner R (1989) Communication and concurrency. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  15. Reed GM (1988) A Uniform Mathematical Theory of Distributed Computing. Ph.D. thesis, Oxford University, Oxford

  16. Reed GM (1990) A hierarchy of domains for Real-time distributed computing. In: Proceedings of 5th workshop on mathematical foundations of programming language semantics, LNCS 442. Springer, Heidelberg, pp 80–128

  17. Roscoe AW (1992) An alternative order for the failures model. J Logic Comput 2(5): 557–577

    Article  MATH  MathSciNet  Google Scholar 

  18. Roscoe AW (1998) The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  19. Reed GM, Roscoe AW (1996) The timed failures-stability model for CSP. Technical monograph PRG-119, Programming Research Group. Oxford University, Oxford

    Google Scholar 

  20. Schneider S (1990) Correctness and communication in Real-time systems. Technical monograph PRG-84, Programming Research Group. Oxford University, Oxford

    Google Scholar 

  21. Stoy JE (1977) Denotational semantics: the Scott-Strachey approach to programming language theory. MIT Press, Cambridge

    Google Scholar 

  22. Tej H, Wolff B (1997) A corrected Failure-Divergence model for CSP in Isabelle/HOL. In: Proceedings of the FME ’97—Industrial Applications and Strengthened Foundations of Formal Methods, LNCS , vol 1313. Springer, Heidelberg

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Westminster, 115 New Cavendish St., London, W1W 6RU, UK

    Paul Howells

  2. Department of Computing, Goldsmiths, University of London, London, SE14 6NW, UK

    Mark d’Inverno

Authors
  1. Paul Howells
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark d’Inverno
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul Howells.

Additional information

J.C.P. Woodcock

Rights and permissions

Reprints and permissions

About this article

Cite this article

Howells, P., d’Inverno, M. A CSP model with flexible parallel termination semantics. Form Asp Comp 21, 421–449 (2009). https://doi.org/10.1007/s00165-008-0098-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-008-0098-z

Keywords

Search

Navigation