Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing
From MaRDI portal
Publication:5403079
DOI10.1007/978-3-642-54624-2_20zbMath1407.68339OpenAlexW189226382MaRDI QIDQ5403079
Mark-Oliver Stehr, Min-Young Kim, Carolyn L. Talcott
Publication date: 25 March 2014
Published in: Specification, Algebra, and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54624-2_20
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Finite-state self-stabilizing protocols in message-passing systems
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
- Conditional rewriting logic as a unified model of concurrency
- Self-stabilizing extensions for message-passing systems
- Exploiting storage redundancy to speed up randomized shared memory simulations
- On asynchronous iterations
- Partial order semantics and read arcs
- Extensions of the UNITY methodology: compositionality, fairness and probability in parallelism
- The expected advantage of asynchrony
- Probability theory. A comprehensive course.
- A Distributed Logic for Networked Cyber-Physical Systems
- Weak vs. Self vs. Probabilistic Stabilization
- Knowledge and common knowledge in a distributed environment
- Impossibility of distributed consensus with one faulty process
- Self-stabilizing systems in spite of distributed control
- Broadcast Gossip Algorithms for Consensus
- Concurrent models for Linda with transactions
- Spatial gossip and resource location protocols
- Computing separable functions via gossip
- Distributed Computing - IWDC 2003
- Self-stabilization by counter flushing