article

Knowledge and common knowledge in a byzantine environment: crash failures

Authors:

Cynthia Dwork,

Yoram MosesAuthors Info & Claims

Information and Computation, Volume 88, Issue 2

Pages 156 - 186

https://doi.org/10.1016/0890-5401(90)90014-9

Published: 01 August 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Alpturer KHalpern Jvan der Meyden ROshman RNolin AHalldorsson MBalliu A(2023)Optimal Eventual Byzantine Agreement Protocols with Omission FailuresProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594573(244-252)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594573
Conde RRajsbaum S(2023)The Solvability of Consensus in Iterated Models Extended with Safe-ConsensusTheory of Computing Systems10.1007/s00224-023-10125-z67:5(901-955)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10125-z
Castañeda AGonczarowski YMoses Y(2022)Unbeatable consensusDistributed Computing10.1007/s00446-021-00417-335:2(123-143)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s00446-021-00417-3
Show More Cited By

Index Terms

Knowledge and common knowledge in a byzantine environment: crash failures

Recommendations

Knowledge Crash and Knowledge Management

Population ageing is a phenomenon that is quite new and irreversible in the history of mankind. Every country and every organisation is concerned while it is not certain that all the risks and challenges have been clearly identified. Clearly, there is a ...
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results
Abstract
This article explores an interplay between process crash failures and concurrency. Namely, it aims at answering the question, “Is it possible to cope with more crash failures when some number of crashes occur before some predefined contention ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Information and Computation Volume 88, Issue 2

Oct. 1990

97 pages

ISSN:0890-5401

Editor:
Albert R. Meyer
Massachusetts Institute of Tech., Cambridge, MA

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

79
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alpturer KHalpern Jvan der Meyden ROshman RNolin AHalldorsson MBalliu A(2023)Optimal Eventual Byzantine Agreement Protocols with Omission FailuresProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594573(244-252)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594573
Conde RRajsbaum S(2023)The Solvability of Consensus in Iterated Models Extended with Safe-ConsensusTheory of Computing Systems10.1007/s00224-023-10125-z67:5(901-955)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10125-z
Castañeda AGonczarowski YMoses Y(2022)Unbeatable consensusDistributed Computing10.1007/s00446-021-00417-335:2(123-143)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s00446-021-00417-3
Fitzi MLiu-Zhang CLoss JMiller ACensor-Hillel K(2021)A New Way to Achieve Round-Efficient Byzantine AgreementProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467907(355-362)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467907
van Ditmarsch H(2021)Wanted Dead or Alive: Epistemic Logic for Impure Simplicial ComplexesLogic, Language, Information, and Computation10.1007/978-3-030-88853-4_3(31-46)Online publication date: 5-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-88853-4_3
Goren GMoses Y(2020)SilenceJournal of the ACM10.1145/337788367:1(1-26)Online publication date: 29-Jan-2020
https://dl.acm.org/doi/10.1145/3377883
Garay JKiayias A(2020)SoK: A Consensus Taxonomy in the Blockchain EraTopics in Cryptology – CT-RSA 202010.1007/978-3-030-40186-3_13(284-318)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1007/978-3-030-40186-3_13
Vukotic IRahli VEsteves-Veríssimo P(2019)Asphalion: trustworthy shielding against Byzantine faultsProceedings of the ACM on Programming Languages10.1145/33605643:OOPSLA(1-32)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360564
Al-Bataineh OReynolds MGnesi SPlat NDay NRossi M(2019)Epistemic model checking of distributed commit protocols with byzantine faultsProceedings of the 7th International Workshop on Formal Methods in Software Engineering10.1109/FormaliSE.2019.00014(51-60)Online publication date: 27-May-2019
https://dl.acm.org/doi/10.1109/FormaliSE.2019.00014
Lenzen CRybicki J(2019)Near-optimal self-stabilising counting and firing squadsDistributed Computing10.1007/s00446-018-0342-632:4(339-360)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00446-018-0342-6
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Knowledge Crash and Knowledge Management

Knowledge and common knowledge in a Byzantine environment I: crash failures

Contention-related crash failures: Definitions, agreement algorithms, and impossibility results

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations