Analysing mutual exclusion using process algebra with signals

MaRDI QIDQ5014797zbMATH OpenFDO

Authors Victor Dyseryn, Peter Höfner, Rob van Glabbeek

Publication date 8 December 2021

Full work available at URL https://arxiv.org/abs/1709.00826, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2017.2

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated analysis of mutual exclusion algorithms using CCS
• Trapping mutual exclusion in the box calculus
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• A queue based mutual exclusion algorithm
• The mutual exclusion problem

Cites work

• scientific article; zbMATH DE number 4164152 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 7317251 (Why is no real title available?)
• scientific article; zbMATH DE number 7319030 (Why is no real title available?)
• A new solution of Dijkstra's concurrent programming problem
• A static view of localities
• A theory of processes with localities
• Analysis of A time‐shared processor
• Automated analysis of mutual exclusion algorithms using CCS
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Encyclopedia of parallel computing.
• Liveness of a mutex algorithm in a fair process algebra
• Mutex needs fairness
• Myths about the mutual exclusion problem
• Observing localities
• Proving Liveness Properties of Concurrent Programs
• Reactive Systems
• Time and Fairness in a Process Algebra with Non-blocking Reading
• Trapping mutual exclusion in the box calculus

Cited in

(9)

• Automated analysis of mutual exclusion algorithms using CCS
• Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
• Off-the-shelf automated analysis of liveness properties for just paths
• scientific article; zbMATH DE number 7559462 (Why is no real title available?)
• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• scientific article; zbMATH DE number 7453962 (Why is no real title available?)
• Reactive bisimulation semantics for a process algebra with timeouts
• Ensuring liveness properties of distributed systems: open problems

This page was built for publication: Analysing mutual exclusion using process algebra with signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014797)