Modelling mutual exclusion in a process algebra with time-outs

DOI10.1016/j.ic.2023.105079arXiv2106.12785OpenAlexW3177337829MaRDI QIDQ6053409

Robert J. van Glabbeek

Publication date: 27 September 2023

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

progressfairnessprocess algebraPetri netsblockingKripke structuressafety propertieslabelled transition systemsmutual exclusionatomicityCCSspeed independencesafe registerstime-outsjustnessasymmetric concurrency relationsfair schedulersoverlapping reads and writesPeterson's protocolreactive temporal logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Just testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mutex needs fairness
• Trapping mutual exclusion in the box calculus
• Automated analysis of mutual exclusion algorithms using CCS
• On interprocess communication. II: Algorithms
• Appraising fairness in languages for distributed programming
• Petri nets, event structures and domains. I
• Myths about the mutual exclusion problem
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Abstract processes of place/transition systems
• Ensuring liveness properties of distributed systems: open problems
• Off-the-shelf automated analysis of liveness properties for just paths
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Fairness of actions in system computations
• Concurrent Programming: Algorithms, Principles, and Foundations
• Time and Fairness in a Process Algebra with Non-blocking Reading
• A Theory of Communicating Sequential Processes
• Process Algebra
• Proving the Correctness of Multiprocess Programs
• Three logics for branching bisimulation
• A new solution of Dijkstra's concurrent programming problem
• Logic in Computer Science
• Analysis of A time‐shared processor

This page was built for publication: Modelling mutual exclusion in a process algebra with time-outs