Complexity issues in automated synthesis of failsafe fault-tolerance

We focus on the problem of synthesizing failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) program. A failsafe fault-tolerant program satisfies its specification (including safety and liveness) in the absence of faults. However, in the presence of faults, it sa...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on dependable and secure computing Vol. 2; no. 3; pp. 201 - 215
Main Authors:	Kulkarni, S.S., Ebnenasir, A.
Format:	Journal Article
Language:	English
Published:	Washington IEEE 01.07.2005 IEEE Computer Society
Subjects:	Agreements Algorithm design and analysis Algorithms Analysis automatic addition of fault-tolerance Automation Computer programming Design Design methodology distributed programs Fault diagnosis Fault tolerance Fault tolerant systems formal methods Heuristic Index Terms- Fault-tolerance Manuals Polynomials program synthesis Safety State-space methods Studies
ISSN:	1545-5971, 1941-0018
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!