On the expressive power of CSP refinement
Formal Aspects of Computing · 2005-08 · 17 (2) · 93-112
DOI: 10.1007/s00165-005-0065-x ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Aspects of Computing, 2005-08. Verfasst von A.W. Roscoe. Die Arbeit wurde bisher 23-mal zitiert (Crossref) und nennt 13 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Roscoe, A. (2005). On the expressive power of CSP refinement. Formal Aspects of Computing, 17(2), 93-112. https://doi.org/10.1007/s00165-005-0065-x
Vancouver
Roscoe A. On the expressive power of CSP refinement. Formal Aspects of Computing. 2005;17(2):93-112. doi:10.1007/s00165-005-0065-x
BibTeX
@article{Roscoe2005,
author = {Roscoe, A.W.},
title = {On the expressive power of CSP refinement},
journal = {Formal Aspects of Computing},
year = {2005},
volume = {17},
number = {2},
pages = {93--112},
doi = {10.1007/s00165-005-0065-x}
}
EUVIMED