Pages that link to "Item:Q2377130"
From MaRDI portal
The following pages link to The Heard-Of model: computing in distributed systems with benign faults (Q2377130):
Displaying 50 items.
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- Consensus when all processes may be Byzantine for some time (Q555306) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- In search of lost time (Q1675756) (← links)
- Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- MinMax algorithms for stabilizing consensus (Q1981802) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- Making Byzantine consensus live (Q2104036) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Synchronization modulo \(P\) in dynamic networks (Q2110375) (← links)
- Valency-based consensus under message adversaries without limit-closure (Q2140525) (← links)
- Fault-tolerant multiparty session types (Q2165214) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
- Counting Constraints in Flat Array Fragments (Q2817911) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults (Q3088334) (← links)
- Synthesis of distributed algorithms with parameterized threshold guards (Q3300835) (← links)
- The Firing Squad Problem Revisited. (Q3304114) (← links)
- (Q3305190) (← links)
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms (Q3449502) (← links)
- Continuous Consensus with Failures and Recoveries (Q3540246) (← links)
- Bosco: One-Step Byzantine Asynchronous Consensus (Q3540249) (← links)
- Using Bounded Model Checking to Verify Consensus Algorithms (Q3540251) (← links)
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms (Q3646255) (← links)
- Back to the Coordinated Attack Problem (Q5006457) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)
- (Q5020999) (← links)
- Derivation of Heard-of Predicates from Elementary Behavioral Patterns (Q5041279) (← links)
- Characterizing Consensus in the Heard-Of Model (Q5089273) (← links)
- (Q5090896) (← links)
- Fast Multidimensional Asymptotic and Approximate Consensus (Q5090919) (← links)
- (Q5091092) (← links)
- (Q5155689) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Asynchronous Byzantine reliable broadcast with a message adversary (Q6050128) (← links)
- Communication pattern logic: epistemic and topological views (Q6054065) (← links)
