Pages that link to "Item:Q793508"
From MaRDI portal
The following pages link to A fair calculus of communicating systems (Q793508):
Displaying 18 items.
- Modal logics for communicating systems (Q578896) (← links)
- Pict correctness revisited (Q1004056) (← links)
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog (Q1075767) (← links)
- About fair asynchrony (Q1085603) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- A fixpoint approach to finite delay and fairness (Q1129259) (← links)
- Weak and strong fairness in CCS (Q1822489) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Keep it fair: equivalence and composition (Q2423741) (← links)
- Fairness of components in system computations (Q2491632) (← links)
- Fair \(\pi\) (Q2866341) (← links)
- Defining process fairness for non-interleaving concurrency (Q3976059) (← links)
- A semantic approach to fairness (Q3993676) (← links)
- (Q4261095) (← links)
- The semantics of priority and fairness in occam (Q5887515) (← links)
