CSP models, a process p re a process q if every behavior of p also is a behavior of q. That is, q is more nondeterministic than p. This notion is the basis of for reasoning about speci in CSP (1994)

by S Abramsky, A Jung, Domain Theory, In S Abramsky, D M Gabbay, T S
Venue:Handbook of Logic and Computer Science