Abstract
We construct a Galois connection between the theories that underlie CCS [7] and CSP [4]. It projects the complete transition system for CCS onto exactly the subset that satisfies the healthiness conditions of CSP. The construction applies to several varieties of both calculi: CCS with strong, weak or barbed simulation, and CSP with trace refinement or failures refinement, or failures/divergence. We suggest the challenge of linking other theories of concurrency by Galois connection. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Jifeng, H., & Hoare, C. A. R. (2005). Linking theories of concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3722 LNCS, pp. 303–317). https://doi.org/10.1007/11560647_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
