Linking theories of concurrency

He Jifeng; C. A.R. Hoare

doi:10.1007/11560647_20

Linking theories of concurrency

He Jifeng^*
, C. A.R. Hoare

^*Corresponding author for this work

Software Engineering Institute

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	303-317
Number of pages	15
DOIs	https://doi.org/10.1007/11560647_20
State	Published - 2005
Event	2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005 - Hanoi, Viet Nam Duration: 17 Oct 2005 → 21 Oct 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3722 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005
Country/Territory	Viet Nam
City	Hanoi
Period	17/10/05 → 21/10/05

Access to Document

10.1007/11560647_20

Cite this

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) (pp. 303-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3722 LNCS). https://doi.org/10.1007/11560647_20

@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",

}

Jifeng, H & Hoare, CAR 2005, Linking theories of concurrency. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3722 LNCS, pp. 303-317, 2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005, Hanoi, Viet Nam, 17/10/05. https://doi.org/10.1007/11560647_20

Linking theories of concurrency. / Jifeng, He; Hoare, C. A.R.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 303-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3722 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Linking theories of concurrency

AU - Jifeng, He

AU - Hoare, C. A.R.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33646394039

U2 - 10.1007/11560647_20

DO - 10.1007/11560647_20

M3 - 会议稿件

AN - SCOPUS:33646394039

SN - 3540291075

SN - 9783540291077

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 303

EP - 317

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005

Y2 - 17 October 2005 through 21 October 2005

ER -

Linking theories of concurrency

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this