Skip to main content
SpringerLink
Log in

A Branching Time Model of CSP

  • Chapter
  • First Online:
Concurrency, Security, and Puzzles

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

Abstract

I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time – branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms.

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 EPUB and 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

References

  1. Aceto, L., Ingólfsdóttir, A.: A theory of testing for ACP. In: Baeten, J.C.M., Groote, J.F. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 78–95. Springer, Heidelberg (1991). doi:10.1007/3-540-54430-5_82

    Google Scholar 

  2. Bergstra, J.A., Klop, J.W., Olderog, E.-R.: Failures withoutchaos: a new process semantics for fair abstraction. In: Wirsing, M. (ed.) Formal Description of Programming Concepts - III, Proceedings of the 3th IFIP WG 2.2 working conference, Ebberup 1986, North-Holland, Amsterdam, pp. 77–103 (1987)

    Google Scholar 

  3. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inform. Control 60, 109–137 (1984). doi:10.1016/S0019-9958(84)80025-X

    Article  MathSciNet  MATH  Google Scholar 

  4. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560–599 (1984). doi:10.1145/828.833

    Article  MathSciNet  MATH  Google Scholar 

  5. Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating processes. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) CONCURRENCY 1984. LNCS, vol. 197, pp. 281–305. Springer, Heidelberg (1985). doi:10.1007/3-540-15670-4_14

    Chapter  Google Scholar 

  6. De Nicola, R.: Two complete Axiom systems for a theory of communicating sequential processes. Inf. Control 64(1–3), 136–172 (1985). doi:10.1016/S0019-9958(85)80048-6

    Article  MathSciNet  MATH  Google Scholar 

  7. Glabbeek, R.J.: The linear time — branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993). doi:10.1007/3-540-57208-2_6

    Google Scholar 

  8. van Glabbeek, R.J., Vaandrager, F.W.: Modular specification of process algebras. Theor. Comput. Sci. 113(2), 293–348 (1993). doi:10.1016/0304-3975(93)90006-F

    Article  MathSciNet  MATH  Google Scholar 

  9. Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Inf. Comput. 100(2), 202–260 (1992). doi:10.1016/0890-5401(92)90013-6

    Article  MathSciNet  MATH  Google Scholar 

  10. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666–677 (1978). doi:10.1145/359576.359585

    Article  MathSciNet  MATH  Google Scholar 

  11. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)

    MATH  Google Scholar 

  12. Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Chap. 19, pp. 1201–1242. Elsevier Science Publishers B.V., North-Holland (1990). Alternatively see Communication and Concurrency. Prentice-Hall (1989), of which an earlier version appeared as A Calculus of Communicating Systems. LNCS, vol. 92. Springer (1980)

    Google Scholar 

  13. Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica 23, 9–66 (1986). doi:10.1007/BF00268075

    Article  MathSciNet  MATH  Google Scholar 

  14. Parrow, J., Sjödin, P.: Multiway synchronization verified with coupled simulation. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 518–533. Springer Berlin Heidelberg, Berlin, Heidelberg (1992). doi:10.1007/BFb0084813

    Google Scholar 

  15. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Upper Saddle River (1997). http://www.comlab.ox.ac.uk/bill.roscoe/publications/68b.pdf.

    Google Scholar 

  16. Roscoe, A.W.: Revivals, stuckness and the hierarchy of CSP models. J. Logic Algebraic Program. 78(3), 163–190 (2009). doi:10.1016/j.jlap.2008.10.002

    Article  MathSciNet  MATH  Google Scholar 

  17. Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010). doi:10.1007/978-1-84882-258-0

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data61, CSIRO, Sydney, Australia

    Rob van Glabbeek

  2. Computer Science and Engineering, University of New South Wales, Sydney, Australia

    Rob van Glabbeek

Authors
  1. Rob van Glabbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rob van Glabbeek .

Editor information

Editors and Affiliations

  1. University of Oxford, Oxford, United Kingdom

    Thomas Gibson-Robinson

  2. University of Oxford, Oxford, United Kingdom

    Philippa Hopcroft

  3. University of Warwick, Coventry, United Kingdom

    Ranko Lazić

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

van Glabbeek, R. (2017). A Branching Time Model of CSP. In: Gibson-Robinson, T., Hopcroft, P., Lazić, R. (eds) Concurrency, Security, and Puzzles. Lecture Notes in Computer Science(), vol 10160. Springer, Cham. https://doi.org/10.1007/978-3-319-51046-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51046-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51045-3

  • Online ISBN: 978-3-319-51046-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation