Z. Chaochen, Weakest environment of communicating processes, Proceedings of the June 7-10, 1982, national computer conference on, AFIPS '82, 1982.
DOI : 10.1145/1500774.1500860

W. De-roever, F. De-boer, U. Hannemann, J. Hooman, Y. Lakhnech et al., Concurrency Verification: Introduction to Compositional and Noncompositional Methods, Cambridge Tracts in Theoretical Computer Science, 2001.

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

A. Kay and J. N. Reed, A rely and guarantee method for timed CSP: a specification and design of a telephone exchange, IEEE Transactions on Software Engineering, vol.19, issue.6, pp.625-639, 1993.
DOI : 10.1109/32.232027

J. Misra and K. M. Chandy, Proofs of Networks of Processes, IEEE Transactions on Software Engineering, vol.7, issue.4, pp.417-426, 1981.
DOI : 10.1109/TSE.1981.230844

N. Moffat and M. Goldsmith, Assumption-commitment via CSP, available from the authors, 2006.

P. K. Pandya, Some comments on the assumption-commitment framework for compositional verification of distributed programs, Lecture Notes in Computer Science, vol.430, pp.622-640, 1989.
DOI : 10.1007/3-540-52559-9_81

C. Pasareanu, M. B. Dwyer, and M. Huth, Assume-Guarantee Model Checking of Software: A Comparative Case Study, 6th International SPIN Workshop on Practical Aspects of Model Checking, pp.168-183, 1999.
DOI : 10.1007/3-540-48234-2_14

A. W. Roscoe, The Theory and Practice of Concurrency, p.565, 1998.

J. B. Scattergood, Tools for CSP and Timed CSP, 1998.

S. Schneider, H. Treharne, and N. Evans, Chunks: Component verification in CSP parallel B, Lecture Notes in Computer Science, vol.3771, 2005.
DOI : 10.1007/11589976_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.362

N. Shankar, Lazy compositional verification Compositionality: The Significant Difference, Proceedings of the International Symposium COMPOS '97, pp.541-564, 1997.

K. Stølen, F. Dederichs, and R. Weber, Specification and refinement of networks of asynchronously communicating agents using the assumption / commitment paradigm, Formal Aspects of Computing, vol.3, 1995.

J. Zwiers, Compositionality and Partial Correctness, LNCS, vol.321, 1989.