Year: 2019
Type: dissertation
Abstract: Fault Tree Analysis is a popular technique used to support the design of critical systems. In a prior work, fault tree semantics have been developed for Non-Deterministic Dynamic FaultTrees that introduces non-determinism to the recovery actions to solve the problem of spare races and improve system reliability. However the existing work only deals with permanent faults. The focus of the thesis work is extending the formalism of NonDeterministic Dynamic Fault Trees to support the notion of repair and develop semantics for Non-Deterministic Repairable Fault Trees to achieve higher availability of system. It includes formalizing the gate semantics and adapting the algorithms for analyzing the fault tree. Furthermore, the thesis work also adapts the minimization algorithms to produce a more compact version of the Recovery Automaton with fewer states
Source: elib (German Aerospace Center)
Author: Yogeswari Renganathan
Institution: Darmstadt University of Applied Sciences
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Hochschule Darmstadt
OpenAlex ID: W2995977549
