1. Abraham, I., Gueta, G., Malkhi, D., Alvisi, L., Kotla, R., Martin, J.P.: Revisiting Fast Practical Byzantine Fault Tolerance (2017)
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);K Bansal,2016
3. Berkovits, I., Lazić, M., Losa, G., Padon, O., Shoham, S.: Verification of threshold-based distributed algorithms by decomposition to decidable logics. CoRR abs/1905.07805 (2019).
http://arxiv.org/abs/1905.07805
4. Bertrand, N., Konnov, I., Lazic, M., Widder, J.: Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries. HAL hal-01925533, November 2018.
https://hal.inria.fr/hal-01925533
5. Lecture Notes in Computer Science;L Moura de,2008