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

DOI10.1007/BF01421675MaRDI QIDQ688830zbMATH OpenOpenAlexFDO

Authors M. C. Fu

Publication date 27 March 1994

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

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

zbMATH Keywords

communicating sequential processesdata-driven evaluationfairnessgeneralized guarded commandslivenesssafety

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 3967907
• scientific article; zbMATH DE number 4106251
• A shared memory algorithm and proof for the generalized alternative construct in CSP
• scientific article; zbMATH DE number 4074449
• scientific article; zbMATH DE number 41233

Cites work

• A shared memory algorithm and proof for the generalized alternative construct in CSP
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• Comments on “Communicating Sequential Processes”
• Communicating sequential processes
• Proving Liveness Properties of Concurrent Programs
• Two Tools for Interprocess Communication in Distributed Data-Flow Systems

This page was built for publication: Attempting guards in parallel: A data flow approach to execute generalized guarded commands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688830)