Virtual trees for the byzantine generals algorithm

Ahuva Tikvati*, Mordechai Ben-Ari, Yifat Ben David Kolikant

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.

Original languageAmerican English
Pages (from-to)392-396
Number of pages5
JournalSIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)
Issue number1
StatePublished - Mar 2004
Externally publishedYes
Event35th SIGCSE Technical Symposium on Computer Science Education - Norfolk, VA, United States
Duration: 3 Mar 20047 Mar 2004


  • Byzantine Generals
  • Distributed algorithms
  • Visualization of algorithms


Dive into the research topics of 'Virtual trees for the byzantine generals algorithm'. Together they form a unique fingerprint.

Cite this