A mathematical model for communicating sequential processes isgiven, and a number of its interesting and useful properties arestated and proved. The possibilities of nondetermimsm are fullytaken intoâ€¦ (More)

The parallel language CSP [9], an earlier version of which was described in [7], has become a major tool for the analysis of structuring methods and proof systems involving parallelism. Theâ€¦ (More)

We show how a variety of confidentiality properties can be expressed in terms of the abstraction mechanisms that CSP provides. We argue that determinism of the abstracted low-security viewpointâ€¦ (More)

We extend the failures inode] of communicating processes to allow' a more satisfactory treatment of divergence in addition to deadlock. The relationship between the revised model and the old model isâ€¦ (More)

FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe the operation of FDR3 at a high level and then give aâ€¦ (More)

We study data nets, a generalisation of Petri nets in which to kens carry data from linearlyordered infinite domains and in which whole-place operation s such as resets and transfers are possible.â€¦ (More)

We propose a denotational model for real time concurrent systems, based on the failures model for CSP. The fixed point theory is based on the Banach fixed point theorem for complete metric spaces,â€¦ (More)