Programming simultaneous actions using common knowledge

DOI10.1007/BF01762112zbMATH Open0646.68031OpenAlexW2092431596MaRDI QIDQ1104074FDOQ1104074

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762112

Recommendations

Common knowledge and consistent simultaneous coordination
Reasoning about concurrent interaction
Reasoning about effects of concurrent actions
Entailment-based actions for coordination
Parallel action: Concurrent dynamic logic with independent modalities
scientific article; zbMATH DE number 2182499
Representing and reasoning about concurrent actions with abductive logic programs
Asynchronous knowledge with hidden actions in the situation calculus
scientific article; zbMATH DE number 928018

common knowledge Byzantine agreement distributed firing squad simultaneous action efficient fault-tolerant protocols knowledge in distributed systems omissions failure model

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Reaching Agreement in the Presence of Faults
A lower bound for the time to assure interactive consistency
Distributed agreement in the presence of processor and communication faults
How processes learn
Title not available (Why is that?)
The Distributed Firing Squad Problem

Cited In (77)

Compact policy routing
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
Continuous Consensus with Ambiguous Failures
Using counterfactuals in knowledge-based programming
Title not available (Why is that?)
States of knowledge
Comparing the Update Expressivity of Communication Patterns and Action Models
Epistemic Logics of Structured Intensional Groups
Optimal Eventual Byzantine Agreement Protocols with Omission Failures
Fire!
Revisiting epistemic logic with names
A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
Resilience of mutual exclusion algorithms to transient memory faults
Dealing with logical omniscience: expressiveness and pragmatics
Byzantine agreement with homonyms
Adaptively secure broadcast, revisited
Naming and identity in epistemic logic. II: A first-order logic for naming
Using knowledge to optimally achieve coordination in distributed systems
Distributed deterministic edge coloring using bounded neighborhood independence
The complexity of almost-optimal simultaneous coordination
Coordinated consensus in dynamic networks
The space complexity of long-lived and one-shot timestamp implementations
No double discount: condition-based simultaneity yields limited gain
Concurrent common knowledge: Defining agreement for asynchronous systems
I'm OK if you're OK: On the notion of trusting commmunication
Unbeatable consensus
MIS on trees
Continuous consensus with ambiguous failures
Distributed graph coloring in a few rounds
Hundreds of impossibility results for distributed computing
Time-efficient randomized multiple-message broadcast in radio networks
From bounded to unbounded concurrency objects and back
Knowledge and common knowledge in a Byzantine environment: Crash failures
Xheal, localized self-healing using expanders
Toward more localized local algorithms, removing assumptions concerning global knowledge
Title not available (Why is that?)
Relating knowledge and coordinated action: the knowledge of preconditions principle
Locally checkable proofs
Optimal-time adaptive strong renaming, with applications to counting
Analyzing consistency properties for fun and profit
Stability of a peer-to-peer communication system
The impact of memory models on software reliability in multiprocessors
A tight unconditional lower bound on distributed randomwalk computation
Common knowledge and consistent simultaneous coordination
The perfectly synchronized round-based model of distributed computing
Scalable rational secret sharing
Knowledge in shared memory systems.
Reasoning about knowledge and messages in asynchronous multi-agent systems
Structuring unreliable radio networks
Error-free multi-valued consensus with Byzantine failures
Simultaneity is harder than agreement
A guide to completeness and complexity for modal logics of knowledge and belief
Minimum congestion mapping in a cloud
Conflict on a communication channel
A knowledge-based analysis of the blockchain protocol
The round complexity of distributed sorting, extended abstract
Common knowledge and update in finite environments
Continuous consensus via common knowledge
Knowledge-based programs
On the round complexity of Byzantine agreement without initial set-up
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Modelling knowledge and action in distributed systems
Choosing social laws for multi-agent systems: Minimality and simplicity
Order optimal information spreading using algebraic gossip
Fast and compact self stabilizing verification, computation, and fault detection of an MST
A complexity separation between the cache-coherent and distributed shared memory models
A note on knowledge-based programs and specifications
The complexity of robust atomic storage
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
A knowledge-based analysis of global function computation
Fault-tolerant spanners
Continuous Consensus with Failures and Recoveries
Belief as defeasible knowledge
Faster information dissemination in dynamic networks via network coding
Tight bounds on information dissemination in sparse mobile networks
Wait-free implementations in message-passing systems
Levels of knowledge in distributed systems.

This page was built for publication: Programming simultaneous actions using common knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104074)