Distributed Termination
From MaRDI portal
Publication:3922146
DOI10.1145/357084.357087zbMath0468.68025OpenAlexW2296352387MaRDI QIDQ3922146
Publication date: 1980
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357084.357087
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
A fully distributed (minimal) spanning tree algorithm, On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Two normal form theorems for CSP programs, A principle for sequential reasoning about distributed algorithms, A distributed algorithm for distributed termination, A fully distributed termination detection scheme, A proof technique for communicating sequential processes, On termination detection in crash-prone distributed systems with failure detectors, A family of optimal termination detection algorithms, The inhibition spectrum and the achievement of causal consistency, A fast distributed deadlock- detection algorithm for hypercube, Simulating asynchronous hardware on multiprocessor platforms: the case of AMULET1, A class of systems with nearly zero distributed simulation overhead, Concurrent common knowledge: Defining agreement for asynchronous systems, Safe termination detection in an asynchronous distributed system when processes may crash and recover, Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP, Prime numbers as a tool to design distributed algorithms, A distributed solution of the distributed termination problem
