Transformations for communication fairness in CSP (Q1089786): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90132-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087370874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the distributed termination convention of CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Implementation for the Generalized Input-Output Construct of CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving Distributed Termination without Freezing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic semantics of communicating sequential processes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:01, 17 June 2024

scientific article
Language Label Description Also known as
English
Transformations for communication fairness in CSP
scientific article

    Statements

    Transformations for communication fairness in CSP (English)
    0 references
    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

    Identifiers