A new solution of Dijkstra's concurrent programming problem

Cited In (81)

Note on an extremal problem arising for unreliable networks in parallel computing
Symmetric and economical solutions to the mutual exclusion problem in a distributed system
Stabilizing mobile philosophers
Linearizable counting networks
An efficient subsumption test pipeline for BS(LRA) clauses
Queue based mutual exclusion with linearly bounded overtaking
Causality-based game solving
Proof assistance for real-time systems using an interactive theorem prover
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
Real-time verification techniques for untimed systems
Nonatomic mutual exclusion with local spinning
Logical classification of distributed algorithms (Bakery algorithms as an example)
A more efficient generalization of Peterson's mutual exclusion algorithm
Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions
A queue based mutual exclusion algorithm
The space complexity of long-lived and one-shot timestamp implementations
Specification and verification of concurrent programs through refinements
Off-the-shelf automated analysis of liveness properties for just paths
Analysing mutual exclusion using process algebra with signals
Recoverable mutual exclusion
Hundreds of impossibility results for distributed computing
Self-stabilizing timestamps
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
The synchronization of independent processes
Implementing sequentially consistent programs on processor consistent platforms
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
Under the hood of the bakery algorithm: mutual exclusion as a matter of priority
A visit to mutual exclusion in seven dates
Self-stabilizing \(\ell\)-exclusion
Waiting in concurrent algorithms
Concurrent abstract state machines
Shared-memory mutual exclusion: major research trends since 1986
Correctness and concurrent complexity of the black-white bakery algorithm
Solvability of the asynchronous ranking problem
The assignment problem
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
What is a ``good encoding of guarded choice?
Convex invariant refinement by control node splitting: a heuristic approach
Starvation-free mutual exclusion with semaphores
Adaptive mutual exclusion with local spinning
Nonatomic dual bakery algorithm with bounded tokens
A first order logic for specification of timed algorithms: Basic properties and a decidable class
Verification by augmented abstraction: The automata-theoretic view
From model checking to equilibrium checking: reactive modules for rational verification
Equational abstractions
Model checking parameterized systems
The space complexity of unbounded timestamps
Highly-fair bakery algorithm using symmetric tokens
Tournaments for mutual exclusion: verification and concurrent complexity
Group mutual exclusion in linear time and space
The Spotlight Principle
A new generalization of Dekker's algorithm for mutual exclusion
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
Abstractions of data types
The mailbox problem
Approximated parameterized verification of infinite-state processes with global conditions
A distributed resource allocation algorithm for many processes
Bounded time-stamps
The complexity of problems in systems of communicating sequential processes
Mutual exclusion as a matter of priority
Verification of Concurrent Programs on Weak Memory Models
Adaptive solutions to the mutual exclusion problem
Adaptive and efficient mutual exclusion
Threshold graphs and synchronization protocols
SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
Mending fences with self-invalidation and self-downgrade
Opportunistic monitoring of multithreaded programs
Sound concurrent traces for online monitoring
Towards a thread-local proof technique for starvation freedom
Modelling mutual exclusion in a process algebra with time-outs
Full abstraction without synchronization primitives
Runtime enforcement of hyperproperties
AutoHyper: explicit-state model checking for HyperLTL
Title not available (Why is that?)
About informatics, distributed computing, and our job: a personal view
Extending the wait-free hierarchy to multi-threaded systems
Efficient Bounded Timestamping from Standard Synchronization Primitives
Recoverable mutual exclusion with abortability
Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
Decision procedures for sequence theories
Towards an automatic proof of the bakery algorithm

This page was built for publication: A new solution of Dijkstra's concurrent programming problem

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