In an earlier paper [13], the author proved that there were three models of CSP that play a special role amongst the ones based on finite observations: the traces $({\cal T})$, stable failures $({\cal F})$ and stable revivals $({\cal R})$ models are successively more refined, but all further models refine ${\cal R}$. In the present paper we prove the corresponding result for the divergence-strict models: ones that treat any process that can diverge immediately as the least in the refinement order. We define what it is to be a divergence-strict model, both for general and finitely nondeterministic CSP, and find that in order to get our result we need to add a new but natural operator into the language.
['A. W. Roscoe']
The Three Platonic Models of Divergence-Strict CSP