Keeping track of the latest gossip in a distributed system
From MaRDI portal
Publication:5137336
DOI10.1007/s004460050031zbMath1448.68152OpenAlexW2061291370MaRDI QIDQ5137336
No author found.
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050031
Related Items
Automated Synthesis of Distributed Controllers ⋮ On Distributed Monitoring and Synthesis ⋮ A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ A model for learning the news in social networks ⋮ Time-stamps for Mazurkiewicz traces. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounded time-stamping in message-passing systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous mappings and asynchronous cellular automata
- Combinatorics on traces
- Some combinatorial aspects of time-stamp systems
- A logical study of distributed transition systems
- Determinizing Büchi asynchronous automata
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Knowledge and common knowledge in a distributed environment
- Notes on finite asynchronous automata
- A survey of gossiping and broadcasting in communication networks
- Determinizing asynchronous automata
- On the complementation of Büchi asynchronous cellular automata
- Asynchronous cellular automata for infinite traces