Transformations for communication fairness in CSP
From MaRDI portal
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.
Recommendations
- Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
- scientific article; zbMATH DE number 3890707
- Appraising fairness in languages for distributed programming
- Automatic construction of CSP programs from sequential non-deterministic programs
- Program refinement in fair transition systems
Cites work
- A Proof System for Communicating Sequential Processes
- Achieving Distributed Termination without Freezing
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- Axiomatic semantics of communicating sequential processes
- Communicating sequential processes
- scientific article; zbMATH DE number 3898219 (Why is no real title available?)
- Modeling the distributed termination convention of CSP
Cited in
(2)
This page was built for publication: Transformations for communication fairness in CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089786)
