• DocumentCode
    3354909
  • Title

    Closure and convergence: a formulation of fault-tolerant computing

  • Author

    Arora, A. ; Gouda, M.

  • Author_Institution
    Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
  • fYear
    1992
  • fDate
    8-10 July 1992
  • Firstpage
    396
  • Lastpage
    403
  • Abstract
    The authors give a formal definition of what it means for a system to tolerate a class of faults. The definition consists of two conditions. First, if a fault occurs when the system state is within some larger set and, if faults continue occurring, the system state remains within that larger set. Second, if faults stop occurring, the system eventually reaches a state within the legal set. The authors demonstrate the applicability of the definition for stating and verifying the fault-tolerance properties of a variety of digital and computer systems. Using the definition, a simple classification is obtained of fault-tolerant systems, and methods for the systematic design of fault-tolerant systems are outlined.<>
  • Keywords
    computation theory; fault tolerant computing; computer systems; convergence; fault-tolerant computing; formal definition; legal set; systematic design; Application software; Computer crashes; Convergence; Design methodology; Fault tolerance; Fault tolerant systems; Law; Legal factors; Microelectronics; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fault-Tolerant Computing, 1992. FTCS-22. Digest of Papers., Twenty-Second International Symposium on
  • Conference_Location
    Boston, MA, USA
  • Print_ISBN
    0-8186-2875-8
  • Type

    conf

  • DOI
    10.1109/FTCS.1992.243596
  • Filename
    243596