\textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
From MaRDI portal
Publication:2828285
Recommendations
- Parameterized model checking of synchronous distributed algorithms by abstraction
- scientific article; zbMATH DE number 222692
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Formal Verification of Distributed Algorithms
- Synthesis of distributed algorithms with parameterized threshold guards
Cited in
(11)- Characterizing Consensus in the Heard-Of Model
- Quorum tree abstractions of consensus protocols
- Derivation of heard-of predicates from elementary behavioral patterns
- Synchronizing the asynchronous
- A modular framework for verifying versatile distributed systems
- Protocol combinators for modeling, testing, and execution of distributed systems
- Cardinality constraints for arrays (decidability results and applications)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- scientific article; zbMATH DE number 7561446 (Why is no real title available?)
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
This page was built for publication: \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828285)
