Linking theories of concurrency

Authors:
He Jifeng;C. A. R. Hoare
Affiliations:
International Institute for Software Technology, The United Nations University, Macau;Microsoft Research, Cambridge, UK
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 8
Cited 0

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Bisimulation through probabilistic testing

Information and Computation
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency

Communication and Concurrency
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Power simulation and its relation to traces and failures refinement

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.