Pages that link to "Item:Q3664419"
From MaRDI portal
The following pages link to An Effective Implementation for the Generalized Input-Output Construct of CSP (Q3664419):
Displayed 16 items.
- Attempting guards in parallel: A data flow approach to execute generalized guarded commands (Q688830) (← links)
- Transformations for communication fairness in CSP (Q1089786) (← links)
- A distributed algorithm to prevent mutual drift between n logical clocks (Q1089788) (← links)
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (Q1090104) (← links)
- Sémantique asynchrone et comportements infinis en CPS (Q1092652) (← links)
- A shared memory algorithm and proof for the generalized alternative construct in CSP (Q1100889) (← links)
- Some impossibility results in interprocess synchronization (Q1261111) (← links)
- A counter-example to an algorithm for the generalized input--output construct of CSP (Q1392214) (← links)
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability (Q1575646) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- Highly concurrent logically synchronous multicast (Q2638776) (← links)
- Mechanical Verification of a Constructive Proof for FLP (Q2829253) (← links)
- Breaking symmetries (Q2971075) (← links)
- (Q3385647) (← links)
- Action systems in incremental and aspect-oriented modeling (Q5138491) (← links)