Attempting guards in parallel: A data flow approach to execute generalized guarded commands
From MaRDI portal
Publication:688830
DOI10.1007/BF01421675zbMath0784.68034OpenAlexW2016310201MaRDI QIDQ688830
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
fairnesslivenesssafetydata-driven evaluationcommunicating sequential processesgeneralized guarded commands
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
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
- Two Tools for Interprocess Communication in Distributed Data-Flow Systems
- Comments on “Communicating Sequential Processes”
- Proving Liveness Properties of Concurrent Programs
- Communicating sequential processes
This page was built for publication: Attempting guards in parallel: A data flow approach to execute generalized guarded commands