Skip to main content
SpringerLink
Log in

Compositional design of multitolerant repetitive byzantine agreement

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1346))

Abstract

We illustrate in this paper a compositional and stepwise method for designing programs that offer a potentially unique tolerance to each of their fault-classes. More specifically, our illustration is a design of a repetitive agreement program that offers two tolerances: (a) it masks the effects of Byzantine failures and (b) it is stabilizing in the presence of transient and Byzantine failures.

Research supported in part by NSF Grant CCR-93-08640, NSA Grant MDA904-96-1-1011 and OSU Grant 221506.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arora and S. S. Kulkarni. Component-based design of multitolerance. Technical Report OSU-CISRC TR37, Ohio State University, 1996.

    Google Scholar 

  2. Z. Liu and M. Joseph. Transformation of programs for fault-tolerance. Formal Aspects of Computing, 4(5):442–469, 1992.

    Article  MATH  Google Scholar 

  3. K. P. Birman and R. van Renesse. Reliable distributed computing using the Isis Toolkit IEEE Computer Society Press, 1994.

    Google Scholar 

  4. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982.

    Google Scholar 

  5. A. Arora and S. S. Kulkarni. Designing masking fault-tolerance via nonmasking faulttolerance. IEEE Transactions on Software Engineering, 1997, to appear.

    Google Scholar 

  6. Y. Zhao and F. B. Bastai. A self-adjusting algorithm for Byzantine agreement. Distributed Computing, 5:219–226, 1992.

    Article  MATH  Google Scholar 

  7. S. S. Kulkarni and A. Arora. Compositional design of multitolerant repetitive Byzantine agreement (preliminary version). Third Workshop on Self-Stabilizing Systems (WSS 97), University of California, Santa Barbara, 1997.

    Google Scholar 

  8. A. Arora and M. G. Gouda. Distributed reset. IEEE Transactions on Computers, 43(9):1026–1038, 1994.

    Article  MATH  Google Scholar 

  9. K. Apt, N. Francez, and W.-P. de Roever. A proof system for communicating sequential processes. ACM transactions on Programming Languages and Systems, pages 359–385, 1980.

    Google Scholar 

  10. H. Schepers. Fault Tolerance and Timing of Distributed Systems: Compositional specification and verification. PhD thesis, Eindhoven University, 1994.

    Google Scholar 

  11. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319–340, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. Goldberg, I. Greenberg, and T. Lawrence. Adaptive fault-tolerance. Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, pages 127–138, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 43210, Columbus, OH, USA

    Sandeep S. Kulkarni & Anish Arora

Authors
  1. Sandeep S. Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anish Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kulkarni, S.S., Arora, A. (1997). Compositional design of multitolerant repetitive byzantine agreement. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058030

Download citation

  • DOI: https://doi.org/10.1007/BFb0058030

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63876-6

  • Online ISBN: 978-3-540-69659-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation