@inproceedings{c104f61a97824a5b886aecc113a75e82,
title = "Linking theories of concurrency",
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.",
author = "He Jifeng and Hoare, \{C. A.R.\}",
year = "2005",
doi = "10.1007/11560647\_20",
language = "英语",
isbn = "3540291075",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "303--317",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
note = "2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005 ; Conference date: 17-10-2005 Through 21-10-2005",
}