The following pages link to How processes learn (Q1082071):
Displaying 49 items.
- On termination detection in crash-prone distributed systems with failure detectors (Q436803) (← links)
- Automata for epistemic temporal logic with synchronous communication (Q616040) (← links)
- On the nonexistence of resilient consensus protocols (Q756398) (← links)
- Flush primitives for asynchronous distributed systems (Q910192) (← links)
- Initial failures in distributed computations (Q915424) (← links)
- Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186) (← links)
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (Q1090104) (← links)
- The synthesis of communication protocols (Q1098296) (← links)
- Programming simultaneous actions using common knowledge (Q1104074) (← links)
- I'm OK if you're OK: On the notion of trusting commmunication (Q1114430) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- On the knowledge requirements of tasks (Q1128492) (← links)
- A framework for viewing atomic events in distributed computations (Q1128710) (← links)
- Mechanical proof systems for logic: Reaching consensus by groups of intelligent agents (Q1176175) (← links)
- Concurrent common knowledge: Defining agreement for asynchronous systems (Q1200914) (← links)
- Coupling coefficients of a distributed execution (Q1208733) (← links)
- Some impossibility results in interprocess synchronization (Q1261111) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Knowledge in shared memory systems. (Q1312600) (← links)
- A semantics for speech acts (Q1353895) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Process technologies, learning and brand proliferation (Q1388867) (← links)
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234) (← links)
- Naming and identity in epistemic logic. II: A first-order logic for naming (Q1855214) (← links)
- Space-time dynamic of normalized doxatons: Automata models of pathological collective mentality (Q1862368) (← links)
- Possibility and impossibility results in a shared memory environment (Q1901689) (← links)
- Topological reasoning and the logic of knowledge (Q1919762) (← links)
- A family of optimal termination detection algorithms (Q1954237) (← links)
- Knowledge, behavior, and rationality: rationalizability in epistemic games (Q2042733) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Comments to `Logics of public communications' (Q2460186) (← links)
- Communication, consensus, and knowledge (Q2640428) (← links)
- A new explanation of the glitch phenomenon (Q2641279) (← links)
- On interactive knowledge with bounded communication (Q2901218) (← links)
- Beyond Lamport's <i>Happened-before</i> (Q3189648) (← links)
- Known Unknowns: Time Bounds and Knowledge of Ignorance (Q3299576) (← links)
- Asynchronous message orderings beyond causality (Q3300832) (← links)
- Reconstruction of non‐logical axioms from the propositions of multi‐agent doxastic logic (Q4269898) (← links)
- Parcours et apprentissage dans un réseau de processus communicants (Q4725734) (← links)
- States of Knowledge (Q4916201) (← links)
- (Q5015395) (← links)
- (Q5018518) (← links)
- Measure of parallelism of distributed computations (Q5096176) (← links)
- The inhibition spectrum and the achievement of causal consistency (Q5137324) (← links)
- A logical approach to multilevel security of probabilistic systems (Q5137350) (← links)
- The power of logical clock abstractions (Q5138510) (← links)
- Levels of knowledge in distributed systems. (Q5955752) (← links)
- Dissecting distributed coordination (Q6062520) (← links)
