Transformations for communication fairness in CSP (Q1089786)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1089786 |
scientific article; zbMATH DE number 4005588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transformations for communication fairness in CSP |
scientific article; zbMATH DE number 4005588 |
Statements
Transformations for communication fairness in CSP (English)
0 references
1987
0 references
Transformations have shown to be a valuable tool for the incorporation of distributed control mechanisms into CSP-programs. This tool will be applied to solve the I/O-guard problem in CSP. The proposed transformation COMFAIR maps a given CSP-program to a CSP-program with I- guards only and introduces the necessary protocol communication. Moreover, for the transformed program we investigate the implications of selection fairness on communication fairness.
0 references
distributed computing
0 references
equivalence
0 references
distributed control mechanisms
0 references
CSP- programs
0 references
I/O-guard problem in CSP
0 references
COMFAIR
0 references
protocol communication
0 references
fairness
0 references
0.7747746109962463
0 references
0.7311592698097229
0 references
0.7159265279769897
0 references
0.6959021091461182
0 references
