Mutex needs fairness

DOI10.1016/S0020-0190(97)00033-1zbMath1336.68182OpenAlexW2090442591MaRDI QIDQ287028

Rolf Walter, Ekkart Kindler

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00033-1

zbMATH Keywords

fairnessPetri netsdistributed systemmutual exclusionpartial-order semanticsprogrees

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Efficiency of asynchronous systems and read arcs in petri nets ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing ⋮ Keep it fair: equivalence and composition ⋮ Unnamed Item ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Modal algebra and Petri nets ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fairness and partial order semantics
• Trapping mutual exclusion in the box calculus
• On the border of causality: contact and confusion
• Fairness and conspiracies
• The existence of refinement mappings
• Event fairness and non-interleaving concurrency
• Appraising fairness in languages for distributed programming
• Myths about the mutual exclusion problem
• The non-sequential behaviour of Petri nets
• Efficiency of asynchronous systems and read arcs in petri nets