Transformations for communication fairness in CSP

DOI10.1016/0020-0190(87)90132-3zbMath0619.68016OpenAlexW2087370874MaRDI QIDQ1089786

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

fairnessequivalencedistributed computingCOMFAIRCSP- programsdistributed control mechanismsI/O-guard problem in CSPprotocol communication

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

A shared memory algorithm and proof for the generalized alternative construct in CSP

Cites Work

• Modeling the distributed termination convention of CSP
• Axiomatic semantics of communicating sequential processes
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• A Proof System for Communicating Sequential Processes
• Achieving Distributed Termination without Freezing
• Communicating sequential processes
• Unnamed Item