The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Byzantine Fault Tolerance, from Theory to Reality
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“PoA is not been tested much for its performance and security threats and is used by the cryptocurrency Decred [122].”
From A Review of Blockchain Architecture and Consensus Protocols: Use Cases, Challenges, and Solutions (2019) · cites this paper as [122]
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Real-time systems: Design principles for distributed embedded applications
Kopetz, H. (1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)90277-7 · Cited by 1,862
The Quantum Postulate and the Recent Development of Atomic Theory1
BOHR, N. (1928) · Nature · doi:10.1038/121580a0 · Cited by 1,700
The Byzantine generals problem
International, S., Lamport, L., Shostak, R. E., International, S., Pease, M. C., & International, S. (2019) · ACM eBooks · doi:10.1145/3335772.3335936 · Cited by 1,034
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 565
FTMP—A highly reliable fault-tolerant multiprocess for aircraft
Hopkins, A. L., Smith, T. B., & Lala, J. H. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11113 · Cited by 370
Impact of deep submicron technology on dependability of VLSI circuits
Constantinescu, C. S. (2003) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2002.1028901 · Cited by 192
Beyond the byzantine generals: unexpected behavior and bridging fault diagnosis
Lavo, D. B., Larrabee, T., & Chess, B. (2002) · doi:10.1109/test.1996.557118 · Cited by 84
Formal verification for time-triggered clock synchronization
Pfeifer, H., Schwier, D., & von Henke, F. W. (2003) · doi:10.1109/dcfts.1999.814297 · Cited by 60
Measured Flip-Flop Responses to Marginal Triggering
Chaney (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676187 · Cited by 49
Cited by
Sorted by citations
Raji, I. D., Smart, A., White, R. N., Mitchell, M., Gebru, T., Hutchinson, B., Smith-Loud, J., Theron, D., & Barnes, P. (2020) · Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency · doi:10.1145/3351095.3372873 · Cited by 2,245
“As modern avionic systems have increased in size and complexity (for example, the Boeing 787 software is estimated at 13 million lines of code [35]), the standard 1-in-1,000,000,000 per use hour maximum failure probability for critical aerospace systems remains an underappreciated engineering marvel [19].”
BackgroundBlockchain Meets IoT: An Architecture for Scalable Access Management in IoT
Novo, O. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2812239 · Cited by 1,318
A Survey on Blockchain Technology: Evolution, Architecture and Security
Bhutta, M. N. M., Khwaja, A. A., Nadeem, A., Ahmad, H. F., Khan, M. K., Hanif, M., Song, H., Alshamari, M., & Cao, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3072849 · Cited by 556
A Survey of IoT Applications in Blockchain Systems
Lao, L., Li, Z., Hou, S., Xiao, B., Guo, S., & Yang, Y. (2020) · ACM Computing Surveys · doi:10.1145/3372136 · Cited by 311
A Comparative Analysis of Blockchain Architecture and its Applications: Problems and Recommendations
Syed, T. A., Alzahrani, A., Jan, S., Siddiqui, M. S., Nadeem, A., & Alghamdi, T. (2019) · IEEE Access · doi:10.1109/access.2019.2957660 · Cited by 286
Metadata
- Authors
- Driscoll, K., Hall, B., Sivencrona, H., & Zumsteg, P.
- Affiliations
- Chalmers University of Technology (SE)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 235-248
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1482321356
- Cited by
- 191
- References
- 16
- Citations by year
- 2026: 2 · 2025: 11 · 2024: 16 · 2023: 11 · 2022: 18 · 2021: 12 · 2020: 15 · 2019: 15 · 2018: 13 · 2017: 6 · 2016: 1 · 2015: 7 · 2014: 8 · 2013: 6 · 2012: 5
- FWCI
- 3.42
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Chalmers Publication Library (Chalmers University of Technology) (submittedVersion)
- Chalmers Research (Chalmers University of Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Keywords
- Byzantine fault tolerance, Byzantine generals problem, Byzantine faults, failure propagation, fault-tolerant architecture, distributed systems, system dependability
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
