Automated analysis of mutual exclusion algorithms using CCS

DOI10.1007/BF01887209zbMATH Open0696.68039OpenAlexW2063510765MaRDI QIDQ911263FDOQ911263

Authors: Daniel J. Walker 

Publication date: 1989

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01887209

Recommendations

• Analysing mutual exclusion using process algebra with signals
• scientific article; zbMATH DE number 7317251
• scientific article; zbMATH DE number 1860625
• The mutual exclusion problem
• The mutual exclusion problem. I: A theory of interprocess communication

zbMATH Keywords

mutual exclusion algorithmsconcurrency workbenchCalculus of Communicating Systems

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• Title not available (Why is that?)
• Modalities for model checking: Branching time logic strikes back
• Local model checking in the modal mu-calculus
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Title not available (Why is that?)
• The mutual exclusion problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• A CCS-based investigation of deadlock in a multi-process electronic mail system
• Modal and temporal logics for processes
• ACTLW -- an action-based computation tree logic with unless operator
• Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
• Analysing mutual exclusion using process algebra with signals
• Static Livelock Analysis in CSP
• Deciding bisimilarity is P-complete
• Equivalence checking 40 years after: a review of bisimulation tools
• Symbolic bisimulations
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Local model checking in the modal mu-calculus
• Trapping mutual exclusion in the box calculus
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• Modelling mutual exclusion in a process algebra with time-outs
• Automatic Mutual Exclusion and Atomicity Checks
• A note on model checking the modal \(\nu\)-calculus
• Liveness of a mutex algorithm in a fair process algebra
• Time and Fairness in a Process Algebra with Non-blocking Reading
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Proof systems for message-passing process algebras
• Exposing latent mutual exclusion by work automata
• Title not available (Why is that?)
• A monotone framework for CCS
• Title not available (Why is that?)

Uses Software

• CESAR

This page was built for publication: Automated analysis of mutual exclusion algorithms using CCS

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