A case study on parametric verification of failure detectors
From MaRDI portal
Recommendations
- Parameterized model checking of synchronous distributed algorithms by abstraction
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Cutoff bounds for consensus algorithms
- scientific article; zbMATH DE number 1444728
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
Cites work
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- A case study on parametric verification of failure detectors
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- A theory of timed automata
- Computer Science Logic
- CONCUR 2004 - Concurrency Theory
- Cutoff bounds for consensus algorithms
- Decidability of parameterized verification
- Exact and efficient verification of parameterized cache coherence protocols
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- Making Byzantine consensus live
- On implementing omega in systems with weak reliability and synchrony assumptions
- Proving properties of a ring of finite-state machines
- Stutter-invariant temporal properties are expressible without the next-time operator
- TLA + Proofs
- Understanding concurrent systems
- Unreliable failure detectors for reliable distributed systems
- Uppaal in a nutshell
Cited in
(2)
This page was built for publication: A case study on parametric verification of failure detectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883746)
