Reasoning about uncertainty in fault-tolerant distributed systems
We present a temporal logic for reasoning about uncertainty in distributed systems that contain both probabilistic and nondeterministic transitions. Probabilistic transitions model randomness in the processes of the system and in the fault model. Nondeterministic transitions model lack of information about the true faulty behavior of the system and the progress of the computation. We demonstrate the naturalness of our approach by offering new analyses and solutions to some classical fault-tolerant distributed computing problems, namely the coordinated attack problem and authenticated Byzantine agreement problem.
KeywordsTemporal Logic Global State Temporal Formula Coin Toss Nondeterministic Choice
Unable to display preview. Download preview PDF.
- [DM86]C. Dwork and Y. Moses, Knowledge and common knowledge in a Byzantine environment I: crash failures (extended abstract), Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference (J. Y. Halpern, ed.), Morgan Kaufmann, 1986, pp. 149–170.Google Scholar
- [FH88]R. Fagin and J. Y. Halpern, Reasoning about knowledge and probability: preliminary report, Theoretical Aspects of Reasoning about Knowledge: Proceedings of the Second (1988) Conference (M. Y. Vardi, ed.), Morgan Kaufmann, March 1988, pp. 277–293.Google Scholar
- [FI86]M. J. Fischer and N. Immerman, Foundations of knowledge for distributed systems, Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference (J. Y. Halpern, ed.), Morgan Kaufmann, 1986, pp. 171–186.Google Scholar
- [FZ87]M. J. Fischer and L. D. Zuck, Relative knowledge and beilief, Technical Report YALE/DCS/TR 589, Yale University, 1987.Google Scholar
- [GMR85]S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, Proc. 17th ACM Symp. on Theory of Computing, 1985, pp. 291–304.Google Scholar
- [HM84]J. Y. Halpern and Y. Moses, Knowledge and common knowledge in a distributed environment, Proc. 3rd ACM Symp. on Principles of Distributed Computing, 1984, pp. 50–61. A revised version appears as IBM Research Report RJ 4421, Aug., 1987.Google Scholar
- [HMT88]J. Y. Halpern, Y. Moses, and M. Tuttle, A knowledge-based analysis of zero knowledge (preliminary report), Proc. 20th ACM Symp. on Theory of Computing, May 1988, pp. 132–147.Google Scholar
- [Pnu83]A. Pnueli, On the extremely fair treatment of probabilistic algorithms, Proc. 15th ACM Symp. on Theory of Computing, 1983.Google Scholar
- [PZ86]A. Pnueli and L. Zuck, Probabilistic verification by tableaux, Proc. First IEEE Symp. on Logic in Computer Science, 1986.Google Scholar
- [TW87]M. Tompa and H. Woll, Random self-reducibility and zero knowledge interactive proofs of possession of information, Proc. 28th IEEE Symp. on Foundations of Computer Science, 1987, pp. 472–482.Google Scholar
- [VW86]M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification (preliminary report), Proc. First IEEE Symp. on Logic in Computer Science, 1986.Google Scholar