A new solution of Dijkstra's concurrent programming problem
From MaRDI portal
Publication:4766565
DOI10.1145/361082.361093zbMath0281.68004OpenAlexW2070908350WikidataQ56068843 ScholiaQ56068843MaRDI QIDQ4766565
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361082.361093
Related Items
Mutual exclusion as a matter of priority, Causality-based game solving, Self-stabilizing timestamps, Unnamed Item, A visit to mutual exclusion in seven dates, Concurrent abstract state machines, Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos, Model Checking Parameterized Systems, Symmetric and economical solutions to the mutual exclusion problem in a distributed system, Full Abstraction Without Synchronization Primitives, Verification of Concurrent Programs on Weak Memory Models, Runtime enforcement of hyperproperties, Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority, The space complexity of unbounded timestamps, Solvability of the asynchronous ranking problem, Extending the wait-free hierarchy to multi-threaded systems, From model checking to equilibrium checking: reactive modules for rational verification, A distributed resource allocation algorithm for many processes, Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems, Highly-fair bakery algorithm using symmetric tokens, The space complexity of long-lived and one-shot timestamp implementations, Off-the-shelf automated analysis of liveness properties for just paths, Tournaments for mutual exclusion: verification and concurrent complexity, On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories, Recoverable mutual exclusion with abortability, Group mutual exclusion in linear time and space, Sound concurrent traces for online monitoring, Modelling mutual exclusion in a process algebra with time-outs, Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms, The complexity of problems in systems of communicating sequential processes, Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions, About informatics, distributed computing, and our job: a personal view, Efficient Bounded Timestamping from Standard Synchronization Primitives, Implementing sequentially consistent programs on processor consistent platforms, Unnamed Item, Nonatomic mutual exclusion with local spinning, Adaptive mutual exclusion with local spinning, A more efficient generalization of Peterson's mutual exclusion algorithm, Unnamed Item, Waiting in concurrent algorithms, Starvation-free mutual exclusion with semaphores, Adaptive solutions to the mutual exclusion problem, Linearizable counting networks, Adaptive and efficient mutual exclusion, Shared-memory mutual exclusion: major research trends since 1986, Hundreds of impossibility results for distributed computing, Closing the complexity gap between FCFS mutual exclusion and mutual exclusion, The mailbox problem, The assignment problem, Equational abstractions, Queue based mutual exclusion with linearly bounded overtaking, Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach, Unnamed Item, Logical classification of distributed algorithms (Bakery algorithms as an example), Recoverable mutual exclusion, Abstractions of data types, Verification by augmented abstraction: The automata-theoretic view, The synchronization of independent processes, A first order logic for specification of timed algorithms: Basic properties and a decidable class, Self-stabilizing \(\ell\)-exclusion, The Spotlight Principle, Correctness and concurrent complexity of the black-white bakery algorithm, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, A queue based mutual exclusion algorithm, Bounded time-stamps, Towards a Thread-Local Proof Technique for Starvation Freedom, A new generalization of Dekker's algorithm for mutual exclusion, Nonatomic dual bakery algorithm with bounded tokens, Approximated parameterized verification of infinite-state processes with global conditions, Stabilizing mobile philosophers, Note on an extremal problem arising for unreliable networks in parallel computing, What is a ``good encoding of guarded choice?, An efficient subsumption test pipeline for BS(LRA) clauses, Proof assistance for real-time systems using an interactive theorem prover, Specification and verification of concurrent programs through refinements, SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
