Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Semantics and Logic for Provable Fault-Tolerance, A Tutorial
| |
|
Semantics and Logic for Provable Fault-Tolerance, A Tutorial
Tomasz Janowski6 
| (6) |
The United Nations University, International Institute for Software Technology, P.O. Box 3058, Macau |
Abstract
This tutorial is about design and proof of design of reliable systems from unreliable components. It teaches the concept and
techniques of fault-tolerance, at the same time building a formal theory where this property can be specified and verified.
The theory eventually supports a range of useful design techniques, especially for multiple faults. We extend CCS, its bisimulation
equivalence and modal logic, under the driving principle that any claim about fault-tolerance should be invariant under the
removal of faults from the assumptions (faults are unpredictable); this principle rejects the reduction of fault-tolerance
to “correctness under all anticipated faults”. The theory is applied to the range of examples and eventually extended to include
considerations of fault-tolerance and timing, under scheduling on the limited resources. This document describes the motivation
and the contents of the tutorial
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|