Liveness of a mutex algorithm in a fair process algebra

DOI10.1007/S00236-009-0092-9zbMath1166.68030OpenAlexW2110430770MaRDI QIDQ1015393

Flavio Corradini, Walter Vogler, Maria Rita Di Berardini

Publication date: 8 May 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-5021

zbMATH Keywords

timed process algebraDekker's algorithmPAFAS

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Liveness of a mutex algorithm in a fair process algebra ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Bisimulation on speed: Worst-case efficiency
• Automated analysis of mutual exclusion algorithms using CCS
• Liveness of a mutex algorithm in a fair process algebra
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Measuring the performance of asynchronous systems with PAFAS
• Weak and strong fairness in CCS
• Fairness of components in system computations
• Fairness of actions in system computations

This page was built for publication: Liveness of a mutex algorithm in a fair process algebra