An Effective Implementation for the Generalized Input-Output Construct of CSP
From MaRDI portal
Publication:3664419
DOI10.1145/69624.357208zbMath0516.68026OpenAlexW2059563369MaRDI QIDQ3664419
Gael N. Buckley, Abraham Silberschatz
Publication date: 1983
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/69624.357208
Related Items (16)
Transformations for communication fairness in CSP ⋮ A distributed algorithm to prevent mutual drift between n logical clocks ⋮ On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes ⋮ Sémantique asynchrone et comportements infinis en CPS ⋮ A shared memory algorithm and proof for the generalized alternative construct in CSP ⋮ Highly concurrent logically synchronous multicast ⋮ A counter-example to an algorithm for the generalized input--output construct of CSP ⋮ Breaking symmetries ⋮ Unnamed Item ⋮ Action systems in incremental and aspect-oriented modeling ⋮ Attempting guards in parallel: A data flow approach to execute generalized guarded commands ⋮ Some impossibility results in interprocess synchronization ⋮ Mechanical Verification of a Constructive Proof for FLP ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ What is a ``good encoding of guarded choice? ⋮ On fairness notions in distributed systems. I: A characterization of implementability
This page was built for publication: An Effective Implementation for the Generalized Input-Output Construct of CSP
