Skip to main content
SpringerLink
Log in

Formal Proof of Impossibility of Reliability in Crashing Protocols

  • Conference paper
Distributed Computing - IWDC 2004 (IWDC 2004)

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

Included in the following conference series:

  • 525 Accesses

Abstract

In a strictly asynchronous system with process failures, it has been known that distributed consensus is impossible [FLP85]. It also has been shown that without persistence, no data link layer can work correctly (this includes all the well known and widely used protocols such as HDLC, etc) [FLMS93]. This work has been extended recently to study the fault span of crash failures [JV00]. In this paper, we present a formal proof of the non-existence of correct crashing network protocols with either unreliable FIFO, reliable FIFO or reliable non-FIFO links using the Input/Output Automata formalism in PVS, a verification system based on higher-order logic.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McMillan, K.L.: Symbolic Model Checking. An approach to the state explosion problem, PhD Thesis, Carnegie Mellon University (1992)

    Google Scholar 

  2. Lynch, N.A., Tuttle, M.R.: An Introduction to Input/Output Automata. CWI Quarterly 2(3), 219–246 (1989)

    MATH  MathSciNet  Google Scholar 

  3. Jayaram, M., Varghese, G.: The Fault Span of Crash Failures. JACM 47(2), 244–293 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fekete, A., Lynch, N., Mansour, Y., Spinelli, J.: The Impossibility of Implementing Reliable Communication in the Face of Crashes. JACM 40(5), 1087–1107 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fischer, Lynch, Patterson: Impossibility of distributed consensus with one faulty processor. In: JACM 1985 (1985)

    Google Scholar 

  6. An Engineering Introduction to Networks. Addison-Wesley, Reading

    Google Scholar 

  7. IISc-CSA-TR-9, http://csa.iisc.ernet.in/TR/2004/9

Download references

Author information

Authors and Affiliations

  1. Computer Science & Automation Indian Institute of Science, Bangalore

    K. Gopinath, Anil K. Pugalia & K. V. M. Naidu

Authors
  1. K. Gopinath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anil K. Pugalia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. V. M. Naidu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Informatics, Arizona State University, 85287, Tempe, AZ,  

    Arunabha Sen

  2. Indian Statistical Institute, Kolkata,  

    Nabanita Das

  3. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, 76019, Arlington, TX, USA

    Sajal K. Das

  4. ACM Unit, Indian Statistical Institute, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gopinath, K., Pugalia, A.K., Naidu, K.V.M. (2004). Formal Proof of Impossibility of Reliability in Crashing Protocols. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30536-1_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24076-1

  • Online ISBN: 978-3-540-30536-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation