scientific article; zbMATH DE number 7649941
From MaRDI portal
Publication:5875395
DOI10.4230/LIPIcs.CONCUR.2019.33MaRDI QIDQ5875395
No author found.
Publication date: 3 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Byzantine faultsthreshold automataparameterized verificationrandomized distributed algorithmscounter systems
Related Items (5)
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Coefficient synthesis for threshold automata ⋮ Eliminating message counters in synchronous threshold automata ⋮ A reduction theorem for randomized distributed algorithms under weak adversaries ⋮ Characterizing Consensus in the Heard-Of Model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Decomposition of distributed programs into communication-closed layers
- Verification of multiprocess probabilistic protocols
- Asynchronous byzantine agreement protocols
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- The correctness proof of Ben-Or's randomized consensus algorithm
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Bosco: One-Step Byzantine Asynchronous Consensus
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Impossibility of distributed consensus with one faulty process
- Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
- Reachability in Parameterized Systems: All Flavors of Threshold Automata
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
This page was built for publication:
