Analysing mutual exclusion using process algebra with signals

zbMATH Open1483.68227arXiv1709.00826MaRDI QIDQ5014797FDOQ5014797

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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
• Title not available (Why is that?)
• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• Title not available (Why is that?)
• 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)