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

DOI10.1007/BF01407934zbMath0641.68041OpenAlexW2027479097MaRDI QIDQ1100889

Richard M. Fujimoto, Hwa-chung Feng

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01407934

zbMATH Keywords

livenesssafetyparallel processingshared memory multiprocessoralternative operationCommunicating sequential processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (1)

Attempting guards in parallel: A data flow approach to execute generalized guarded commands

Cites Work

• Unnamed Item
• Transformations for communication fairness in CSP
• Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• Comments on “Communicating Sequential Processes”
• Proving Liveness Properties of Concurrent Programs
• Guarded commands, nondeterminacy and formal derivation of programs
• Communicating sequential processes
• CSM: A Distributed Programming Language

This page was built for publication: A shared memory algorithm and proof for the generalized alternative construct in CSP