Distributed Termination
From MaRDI portal
Cited in
(20)- A fast distributed deadlock- detection algorithm for hypercube
- Two normal form theorems for CSP programs
- Concurrent common knowledge: Defining agreement for asynchronous systems
- A fully distributed termination detection scheme
- On termination detection in crash-prone distributed systems with failure detectors
- Simulating asynchronous hardware on multiprocessor platforms: The case of AMULET1
- Safe termination detection in an asynchronous distributed system when processes may crash and recover
- A fully distributed (minimal) spanning tree algorithm
- A proof technique for communicating sequential processes
- The inhibition spectrum and the achievement of causal consistency
- A distributed solution of the distributed termination problem
- A family of optimal termination detection algorithms
- Silent anonymous snap-stabilizing termination detection
- A class of systems with nearly zero distributed simulation overhead
- A distributed algorithm for distributed termination
- Prime numbers as a tool to design distributed algorithms
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- Reducing the number of messages in self-stabilizing protocols
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- A principle for sequential reasoning about distributed algorithms
This page was built for publication: Distributed Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922146)
