scientific article; zbMATH DE number 7441256

zbMath1483.68227arXiv1709.00826MaRDI QIDQ5014797

Victor Dyseryn, Peter Höfner, Robert J. van Glabbeek

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/1709.00826

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Off-the-shelf automated analysis of liveness properties for just paths ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Unnamed Item ⋮ Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)

Cites Work

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