Skip to main content Accessibility help

Models for CSP with availability information

  • GAVIN LOWE (a1)

We consider models of CSP based on recording availability information, i.e. the models record what events could have been performed instead of those that were actually performed. We present many different varieties of such models. For each, we give a compositional semantics, congruent to the operational semantics, and prove full abstraction and no-junk results. We compare the expressiveness of the different models.

Hide All
Andrews, G. R. (2000) Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley.
Bolton, C. and Lowe, G. (2004) A hierarchy of failures-based models. Electronic Notes in Theoretical Computer Science 96 129152.
de Nicola, R. and Hennessy, M. C. B. (1984) Testing equivalences for processes. Theoretical Computer Science 34 83133.
Formal Systems (Europe) Ltd. (2005) Failures Divergence Refinement – User Manual and Tutorial, Version 2.8.2.
Gibson-Robinson, T. (2010) Tyger: A Tool for Automatically Simulating CSP-Like Languages in CSP, Master's thesis, Oxford University
Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice Hall.
Lowe, G. (2009) Extending CSP with tests for availability. In: Proceedings of Concurrent Process Architectures, IOS Press 325348.
Milner, R. (1980) A Calculus of Communicating Systems. Springer Lecture Notes in Computer Science 92.
Mukarram, A. (1993) A Refusal Testing Model for CSP, D. Phil thesis, Oxford.
Olderog, E. R. and Hoare, C. A. R. (1983) Specification-oriented semantics for communicating processes. In: Diaz, J. (ed.) 10th ICALP. Lecture Notes in Computer Science 154 561572.
Phillips, I. (1987) Refusal testing. Theoretical Computer Science.
Roscoe, A. W. (1994) Model-checking CSP. In: A Classical Mind, Essays in Honour of C. A. R. Hoare, Prentice-Hall 353378.
Roscoe, A. W. (1997) The Theory and Practice of Concurrency, Prentice Hall.
Roscoe, A. W. (2005) Seeing beyond divergence. In: Proceedings of ‘25 Years of CSP’. Lecture Notes in Computer Science 3525 1525.
Roscoe, A. W. (2009) On the expressiveness of CSP. Available via
Roscoe, A. W. (2009) Revivals, stuckness and the hierarchy of CSP models. Journal of Logic and Algebraic Programming 78 (3) 163190.
Roscoe, A. W. (2010) Understanding Concurrent Systems, Springer.
van Glabbeek, R. J. (1993) The linear time–branching time spectrum II; the semantics of sequential systems with silent moves (extended abstract). In: Proceedings CONCUR'93, 4th International Conference on Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 715 6681.
van Glabbeek, R. J. (2001) The linear time–branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J. A., Ponse, A. and Smolka, S. A. (eds.) Handbook of Process Algebra, Elsevier chapter 1, 399.
Welch, P., Brown, N., Morres, J., Chalmers, K. and Sputh, B. (2007) Integrating and extending JCSP. In: Communicating Process Architectures 48–76.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed