Mutex needs fairness

DOI10.1016/S0020-0190(97)00033-1MaRDI QIDQ287028zbMATH OpenOpenAlexFDO

Authors 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)

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)

• Efficiency of asynchronous systems and read arcs in petri nets
• A compositional partial order semantics for Petri net components
• Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
• Just testing
• Modal algebra and Petri nets
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Analysing mutual exclusion using process algebra with signals
• Keep it fair: equivalence and composition
• Ensuring liveness properties of distributed systems: open problems
• Modelling mutual exclusion in a process algebra with time-outs
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

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)