• DocumentCode
    1010707
  • Title

    Closure and convergence: a foundation of fault-tolerant computing

  • Author

    Arora, Ankh ; Gouda, Mohamed

  • Author_Institution
    Dept. of Comput. Sci., Ohio State Univ., Columbus, OH, USA
  • Volume
    19
  • Issue
    11
  • fYear
    1993
  • fDate
    11/1/1993 12:00:00 AM
  • Firstpage
    1015
  • Lastpage
    1027
  • Abstract
    The authors formally define what it means for a system to tolerate a class of faults. The definition consists of two conditions. The first is that if a fault occurs when the system state is within the set of legal states, the resulting state is within some larger set and, if faults continue to occur, the system state remains within that larger set (closure). The second is that if faults stop occurring, the system eventually reaches a state within the legal set (convergence). The applicability of the definition for specifying and verifying the fault-tolerance properties of a variety of digital and computer systems is demonstrated. Using the definition, the authors obtain a simple classification of fault-tolerant systems. Methods for the systematic design of such systems are discussed
  • Keywords
    fault tolerant computing; formal verification; closure; convergence; fault-tolerant computing; legal states; verification; Computer crashes; Computer errors; Computer science; Convergence; Design methodology; Fault tolerance; Fault tolerant systems; Law; Legal factors; Terminology;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.256850
  • Filename
    256850