Transformations for communication fairness in CSP

DOI10.1016/0020-0190(87)90132-3MaRDI QIDQ1089786zbMATH OpenOpenAlexFDO

Authors Dieter Zöbel

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90132-3

zbMATH Keywords

fairnessdistributed computingequivalenceCOMFAIRCSP- programsdistributed control mechanismsI/O-guard problem in CSPprotocol communication

Mathematics Subject Classification ID

Theory of operating systems (68N25)

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

• scientific article; zbMATH DE number 3898219 (Why is no real title available?)
• 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
• Modeling the distributed termination convention of CSP

Cited in

(2)

• A shared memory algorithm and proof for the generalized alternative construct in CSP
• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)

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)