Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
From MaRDI portal
Publication:1822234
DOI10.1016/0304-3975(87)90005-3zbMath0617.68023OpenAlexW1969548902MaRDI QIDQ1822234
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90005-3
Related Items
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Interleaving set temporal logic, A framework for viewing atomic events in distributed computations, Efficient detection of restricted classes of global predicates, Flush primitives for asynchronous distributed systems, Techniques and applications of computation slicing, Synchronous, asynchronous, and causally ordered communication, Proving partial order properties
Cites Work
- How processes learn
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- Two normal form theorems for CSP programs
- Termination detection for diffusing computations
- A distributed solution of the distributed termination problem
- Derivation of a termination detection algorithm for distributed computations
- Distributed Termination
- Achieving Distributed Termination without Freezing
- Termination Detection of Diffusing Computations in Communicating Sequential Processes
- Time, clocks, and the ordering of events in a distributed system
- Communicating sequential processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
