Retrenchment, and the generation of fault trees for static, dynamic and cyclic systems

12Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For large systems, the manual construction of fault trees is error-prone, encouraging automated techniques. In this paper we show how the retrenchment approach to formal system model evolution can be developed into a versatile structured approach for the mechanical construction of fault trees. The system structure and the structure of retrenchment concessions interact to generate fault trees with appropriately deep nesting. The same interactions fuel a structural approach to hierarchical fault trees, allowing a system and its faults to be viewed at multiple levels of abstraction. We show how this approach can be extended to deal with minimisation, thereby diminishing the post-hoc subsumption workload and potentially rendering some infeasible cases feasible. The techniques we describe readily generalise to encompass timing, allowing glitches and other transient errors to be properly described. Lastly, a mild generalisation to cope with cyclic system descriptions allows the timed theory to encompass systems with feedback. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Banach, R., & Bozzano, M. (2006). Retrenchment, and the generation of fault trees for static, dynamic and cyclic systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4166 LNCS, pp. 127–141). Springer Verlag. https://doi.org/10.1007/11875567_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free