Cites work
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3972158 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 193318 (Why is no real title available?)
- scientific article; zbMATH DE number 723228 (Why is no real title available?)
- Appraising fairness in languages for distributed programming
- Efficiency of asynchronous systems and read arcs in petri nets
- Event fairness and non-interleaving concurrency
- Fairness and conspiracies
- Fairness and partial order semantics
- Myths about the mutual exclusion problem
- On the border of causality: contact and confusion
- The existence of refinement mappings
- The non-sequential behaviour of Petri nets
- Trapping mutual exclusion in the box calculus
Cited in
(11)- A compositional partial order semantics for Petri net components
- Efficiency of asynchronous systems and read arcs in petri nets
- Analysing mutual exclusion using process algebra with signals
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Keep it fair: equivalence and composition
- Modelling mutual exclusion in a process algebra with time-outs
- Just testing
- Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Modal algebra and Petri nets
- Ensuring liveness properties of distributed systems: open problems
This page was built for publication: Mutex needs fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287028)
