Abstract
When considering n-process asynchronous systems, where up to t processes can fail, and communication is by read/write registers or reliable message-passing, are (from a computability point of view) Byzantine failures “different” from crash failures? This is the question addressed in this paper, which shows that the answer is “no” for systems where t
Cite
CITATION STYLE
Imbs, D., Raynal, M., & Stainer, J. (2016). Are byzantine failures really different from crash failures? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9888 LNCS, pp. 215–229). Springer Verlag. https://doi.org/10.1007/978-3-662-53426-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
