%T Acceptances, Behaviours and Infinite Activity in CSPP
%A Adrian E. Lawrence
%E  James S. Pascoe,  Roger J. Loader,  Vaidy S. Sunderam
%B Communicating Process Architectures 2002
%X The denotational semantics presented here defines an
   extension of CSP called CSPP. It includes a full description
   of infinite behaviour in one simple model using only finite
   traces. This is true for both finite and infinite alphabets.
   The structure is a complete lattice, and so also a complete
   partial order, under refinement. Thus recursion is defined
   by fixed points in the usual way. It is also a complete
   restriction metric space so this provides an alternative
   treatment of recursion for contraction mappings.