An Effective Implementation for the Generalized Input-Output Construct of CSP

DOI10.1145/69624.357208MaRDI QIDQ3664419zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

guarded commandsnondeterminismoutput guardsparallel programmingprocess communication

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(18)

• 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
• Some impossibility results in interprocess synchronization
• A counter-example to an algorithm for the generalized input--output construct of CSP
• 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
• Highly concurrent logically synchronous multicast
• Mechanical Verification of a Constructive Proof for FLP
• Breaking symmetries
• Comparing process calculi using encodings
• Constructive Proof FLP
• Action systems in incremental and aspect-oriented modeling
• Attempting guards in parallel: A data flow approach to execute generalized guarded commands
• CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce

This page was built for publication: An Effective Implementation for the Generalized Input-Output Construct of CSP

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