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