How processes learn
From MaRDI portal
Publication:1082071
DOI10.1007/BF01843569zbMath0602.68026MaRDI QIDQ1082071
Publication date: 1986
Published in: Distributed Computing (Search for Journal in Brave)
Related Items (48)
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes ⋮ On interactive knowledge with bounded communication ⋮ Reconstruction of non‐logical axioms from the propositions of multi‐agent doxastic logic ⋮ Unnamed Item ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ The synthesis of communication protocols ⋮ A semantics for speech acts ⋮ Communication, consensus, and knowledge ⋮ A new explanation of the glitch phenomenon ⋮ Possibility and impossibility results in a shared memory environment ⋮ Programming simultaneous actions using common knowledge ⋮ Beyond Lamport's Happened-before ⋮ I'm OK if you're OK: On the notion of trusting commmunication ⋮ The complexity of reasoning about knowledge and time. I: Lower bounds ⋮ Topological reasoning and the logic of knowledge ⋮ Common knowledge and update in finite environments ⋮ On the knowledge requirements of tasks ⋮ A framework for viewing atomic events in distributed computations ⋮ Measure of parallelism of distributed computations ⋮ Automata for epistemic temporal logic with synchronous communication ⋮ Dissecting distributed coordination ⋮ Logical omniscience ⋮ On termination detection in crash-prone distributed systems with failure detectors ⋮ Flush primitives for asynchronous distributed systems ⋮ Unnamed Item ⋮ A family of optimal termination detection algorithms ⋮ Initial failures in distributed computations ⋮ Unnamed Item ⋮ Knowledge and common knowledge in a Byzantine environment: Crash failures ⋮ The inhibition spectrum and the achievement of causal consistency ⋮ A logical approach to multilevel security of probabilistic systems ⋮ The power of logical clock abstractions ⋮ Mechanical proof systems for logic: Reaching consensus by groups of intelligent agents ⋮ Known Unknowns: Time Bounds and Knowledge of Ignorance ⋮ Comments to `Logics of public communications' ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Concurrent common knowledge: Defining agreement for asynchronous systems ⋮ States of Knowledge ⋮ Coupling coefficients of a distributed execution ⋮ Levels of knowledge in distributed systems. ⋮ Knowledge, behavior, and rationality: rationalizability in epistemic games ⋮ Some impossibility results in interprocess synchronization ⋮ Modelling knowledge and action in distributed systems ⋮ On the nonexistence of resilient consensus protocols ⋮ 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 ⋮ Knowledge in shared memory systems. ⋮ Space-time dynamic of normalized doxatons: Automata models of pathological collective mentality
Cites Work
This page was built for publication: How processes learn
