How processes learn
Processes in distributed systems communicate with one another exclusively by sending and receiving messages. A process has access to its state but not to the states of other processes. Many distributed algorithms require that a process determine facts about the overall system computation. In anthropomorphic terms, processes learn about states of other processes in the evolution of system computation. This paper is concerned with how processes learn. We give a precise characterization of the minimum information law necessary for a process to determine specific facts about the system.
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- The synthesis of communication protocols
- Programming simultaneous actions using common knowledge
- I'm OK if you're OK: On the notion of trusting commmunication
- The complexity of reasoning about knowledge and time. I: Lower bounds
- On the knowledge requirements of tasks
- A framework for viewing atomic events in distributed computations
- Mechanical proof systems for logic: Reaching consensus by groups of intelligent agents
- Concurrent common knowledge: Defining agreement for asynchronous systems
- Coupling coefficients of a distributed execution
- Some impossibility results in interprocess synchronization
- Modelling knowledge and action in distributed systems
- Knowledge in shared memory systems.
- A semantics for speech acts
- Common knowledge and update in finite environments
- Process technologies, learning and brand proliferation
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Naming and identity in epistemic logic. II: A first-order logic for naming
- Space-time dynamic of normalized doxatons: Automata models of pathological collective mentality
- Possibility and impossibility results in a shared memory environment
- Topological reasoning and the logic of knowledge
- A family of optimal termination detection algorithms
- Knowledge, behavior, and rationality: rationalizability in epistemic games
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- The Heard-Of model: computing in distributed systems with benign faults
- Comments to `Logics of public communications'
- Communication, consensus, and knowledge
- A new explanation of the glitch phenomenon
- On interactive knowledge with bounded communication
- Beyond Lamport's Happened-before
- Known unknowns: time bounds and knowledge of ignorance
- Asynchronous message orderings beyond causality
- Reconstruction of non‐logical axioms from the propositions of multi‐agent doxastic logic
- On termination detection in crash-prone distributed systems with failure detectors
- scientific article; zbMATH DE number 3999275 (Why is no real title available?)
- States of knowledge
- Relating knowledge and coordinated action: the knowledge of preconditions principle
- Causality and epistemic reasoning in Byzantine multi-agent systems
- Measure of parallelism of distributed computations
- The inhibition spectrum and the achievement of causal consistency
- A logical approach to multilevel security of probabilistic systems
- The power of logical clock abstractions
- Levels of knowledge in distributed systems.
- Dissecting distributed coordination
- Logical omniscience
- Automata for epistemic temporal logic with synchronous communication
- On the nonexistence of resilient consensus protocols
- Flush primitives for asynchronous distributed systems
- Initial failures in distributed computations
- Knowledge and common knowledge in a Byzantine environment: Crash failures
This page was built for publication: How processes learn
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082071)
