Synthesis of distributed algorithms with parameterized threshold guards
From MaRDI portal
Publication:3300835
Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- A logic-based framework for verifying consensus algorithms
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Bosco: One-Step Byzantine Asynchronous Consensus
- Chapar: certified causally consistent distributed key-value stores
- Cutoff bounds for consensus algorithms
- Decidability of parameterized verification
- Parameterized Synthesis
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- Synchronous counting and computational algorithm design
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- The Heard-Of model: computing in distributed systems with benign faults
- Unreliable failure detectors for reliable distributed systems
Cited in
(11)- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Eliminating message counters in synchronous threshold automata
- Temporal prophecy for proving temporal properties of infinite-state systems
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Complexity of Verification and Synthesis of Threshold Automata
- Synthesis of distributed agreement-based systems with efficiently-decidable verification
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Reachability in parameterized systems: all flavors of threshold automata
- Coefficient synthesis for threshold automata
- Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
Describes a project that uses
Uses Software
This page was built for publication: Synthesis of distributed algorithms with parameterized threshold guards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300835)
