The following pages link to (Q3738540):
Displaying 50 items.
- Mutex needs fairness (Q287028) (← links)
- Starvation-free mutual exclusion with semaphores (Q469360) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- Fairness and partial order semantics (Q672492) (← links)
- On the border of causality: contact and confusion (Q672875) (← links)
- On the logic of UNITY (Q673960) (← links)
- Computable concurrent processes (Q673972) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- Complete proof rules for strong fairness and strong extreme fairness (Q685427) (← links)
- Quantitatively fair scheduling (Q764298) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm (Q860848) (← links)
- Symmetry breaking in distributed networks (Q918187) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Alternating-time stream logic for multi-agent systems (Q967523) (← links)
- On conditions for the liveness of weakly persistent nets (Q989543) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Fairness in context-free grammars under every choice-strategy (Q1122988) (← links)
- On verifying that a concurrent program satisfies a nondeterministic specification (Q1123589) (← links)
- A fixpoint approach to finite delay and fairness (Q1129259) (← links)
- Completing the temporal picture (Q1176248) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems (Q1191025) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- Strong fairness and ultra metrics (Q1193893) (← links)
- A compositional axiomatization of statecharts (Q1194330) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- Semantic models for total correctness and fairness (Q1208419) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Proving partial order properties (Q1322161) (← links)
- A compositional framework for fault tolerance by specification transformation (Q1330423) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- A self-stabilizing algorithm for strong fairness (Q1387705) (← links)
- Fairness and control in multi-agent systems (Q1389683) (← links)
- Semantics for finite delay (Q1392281) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Probabilistic termination versus fair termination (Q1822937) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- On control of systems modelled as deterministic Rabin automata (Q1902499) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← 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)
- Soundness and completeness proofs by coinductive methods (Q2362498) (← links)
- Model checking with fairness assumptions using PAT (Q2418662) (← links)
- Keep it fair: equivalence and composition (Q2423741) (← links)
