Abstract
We show that wide-ranging classes of predicates on the failures-divergences model for CSP can be represented by refinement checks in a general form. These are predicates of a process P expressible as F(P)⊏G(P), where F and G are CSP contexts and ⊏ is refinement. We use ideas similar to full abstraction, but achieve a stronger property than that. Our main result is that topologically-closed predicates are precisely those representable when F and G are both uniformly continuous. We show that sub-classes of predicates such as refinement-closed and distributive ones are represented by special forms of this check.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received November 2003
Revised July 2004
Accepted December 2004 by M. Leuschel and D. J. Cooke
Rights and permissions
About this article
Cite this article
Roscoe, A. On the expressive power of CSP refinement. Form Asp Comp 17, 93–112 (2005). https://doi.org/10.1007/s00165-005-0065-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-005-0065-x