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