@InProceedings{Lawrence02a,
  title =        "{A}cceptances, {B}ehaviours and {I}nfinite {A}ctivity in {CSPP}",
  author=        "Lawrence, Adrian E.",
  editor=        "Pascoe,  James S. and Loader,  Roger J. and Sunderam,  Vaidy S.",
  pages =        "17--38",
  booktitle=     "{C}ommunicating {P}rocess {A}rchitectures 2002",
  isbn=          "1 58603 268 2",
  year=          "2002",
  month=         "sep",
  abstract=      "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."
}