Pages that link to "Item:Q1112589"
From MaRDI portal
The following pages link to Appraising fairness in languages for distributed programming (Q1112589):
Displaying 33 items.
- Mutex needs fairness (Q287028) (← links)
- Foundations for using linear temporal logic in Event-B refinement (Q333316) (← links)
- On fairness and randomness (Q840697) (← links)
- Event fairness and non-interleaving concurrency (Q911318) (← links)
- Combining partial-order reductions with on-the-fly model-checking. (Q960506) (← links)
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (Q1090104) (← links)
- Fairness and the axioms of control predicates (Q1104729) (← links)
- Appraising fairness in languages for distributed programming (Q1112589) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- Sooner is safer than later (Q1199553) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- On equivalence-completions of fairness assumptions (Q1205189) (← links)
- Some impossibility results in interprocess synchronization (Q1261111) (← links)
- Fairness and hyperfairness in multi-party interactions (Q1261113) (← links)
- A self-stabilizing algorithm for strong fairness (Q1387705) (← links)
- On projective and separable properties (Q1389766) (← links)
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability (Q1575646) (← links)
- Timed runtime monitoring for multiparty conversations (Q1682289) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies (Q1854420) (← links)
- On the limits of refinement-testing for model-checking CSP (Q1941896) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Population protocols with unreliable communication (Q2148893) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Model checking with fairness assumptions using PAT (Q2418662) (← links)
- Positive Dedalus programs tolerate non-causality (Q2453541) (← links)
- An optimal self-stabilizing strarvation-free alternator (Q2575834) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
- Protocols with constant local storage and unreliable communication (Q2699979) (← links)
- Action systems in incremental and aspect-oriented modeling (Q5138491) (← links)
- Modelling mutual exclusion in a process algebra with time-outs (Q6053409) (← links)
