ajout biblio

Recherche/BFT-ARBover/main.tex

@@ -113,7 +113,7 @@
 \begin{document}
 
 \section{Model 1: Crash}
-We consider a static set $\Pi$ of $n$ processes with known identities, communicating by reliable point-to-point channels, in a complete graph. Messages are uniquely identifiable. At most $f$ processes can crash, with $n \geq f$.
+We consider a static set $\Pi$ of $n$ processes with known identities, communicating by reliable point-to-point channels, in a complete graph. Messages are uniquely identifiable. At most $f$ processes can crash, with $n \geq f$, in the standard asynchronous crash-failure message-passing model~\cite{ChandraToueg96}.
 
 \paragraph{Synchrony.} The network is asynchronous.
 
@@ -298,6 +298,27 @@ For any operation $F \in O$,$F_i(...)$ denotes that the operation $F$ is invoked
 \bibliographystyle{plain}
 \begin{thebibliography}{9}
 % (left intentionally blank)
+\bibitem{frey:disc23}
+Davide Frey, Mathieu Gestin, and Michel Raynal.
+\newblock The synchronization power (consensus number) of access-control objects: The case of allowlist and denylist.
+\newblock {\em LIPIcs, DISC 2023}, 281:21:1--21:23, 2023.
+\newblock doi:10.4230/LIPIcs.DISC.2023.21.
+
+\bibitem{Bracha87}
+Gabriel Bracha.
+\newblock Asynchronous byzantine agreement protocols.
+\newblock {\em Information and Computation}, 75(2):130--143, 1987.
+
+\bibitem{Defago2004}
+Xavier Defago, Andre Schiper, and Peter Urban.
+\newblock Total order broadcast and multicast algorithms: Taxonomy and survey.
+\newblock {\em ACM Computing Surveys}, 36(4):372--421, 2004.
+
+\bibitem{ChandraToueg96}
+Tushar Deepak Chandra and Sam Toueg.
+\newblock Unreliable failure detectors for reliable distributed systems.
+\newblock {\em Journal of the ACM}, 43(2):225--267, 1996.
+
 \bibitem{Schneider90}
 Fred B.~Schneider.
 \newblock Implementing fault-tolerant services using the state machine