Model Checking a Fault-Tolerant Startup Algorithm: From Design Exploration To Exhaustive Fault Simulation

The increasing performance of modern model-checking tools offers high potential for the computer-aided design of fault-tolerant algorithms. Instead of relying on human imagination to generate taxing failure scenarios to probe a fault-tolerant algorithm during development, we define the fault behavior of a faulty process at its interfaces to the remaining system and use model checking to automatically examine all possible failure scenarios. We call this approach exhaustive fault simulation . In this paper we illustrate exhaustive fault simulation using a new startup algorithm for the Time-Triggered Architecture (TTA) and show that this approach is fast enough to be deployed in the design loop. We use the SAL toolset from SRI for our experiments and describe an approach to modeling and analyzing fault-tolerant algorithms that exploits the capabilities of tools such as this.

Accepted for publication to DSN 2004. Copyright Springer Verlag LNCS

gzipped postscript or postscript

BibTeX Entry

@MISC{SRSP:dsn04,
  author =    {Wilfried Steiner, John Rushby, Maria Sorea and Holger Pfeifer},
  title =     {Model Checking a Fault-Tolerant Startup Algorithm: 
               From Design Exploration To Exhaustive Fault Simulation}
  howpublished =   {To be presented at DSN 2004},
  year =      {2004}
}