@InProceedings{MartinJassim98,
  title =        "{A} {T}echnique for {C}hecking the {CSP} sat {P}roperty",
  author=        "Martin,  Jeremy M. R. and Jassim,  S. A.",
  editor=        "Welch, Peter H. and Bakkers,  Andr\`{e} W. P.",
  pages =        "93--110",
  booktitle=     "{P}roceedings of {W}o{TUG}-21: {A}rchitectures, {L}anguages and {P}atterns for {P}arallel and {D}istributed {A}pplications",
  isbn=          "90 5199 391 9",
  year=          "1998",
  month=         "mar",
  abstract=      "This paper presents an algorithm for checking that a CSP
     process satisfies a specification defined by a
     boolean-valued function on its traces and refusals, i.e. P
     sat f(tr, ref) This is contrasted with the refinement
     approach, as implemented by the FDR tool, of checking that
     one CSP process is a possible implementation of another,
     i.e. P \>= SPEC"
}