Skip to main content

Compositional synthesis of temporal fault trees from state machines

Papadopoulos, Yiannis; Walker, Martin; Mahmud, Nidhal

Authors

Martin Walker

Nidhal Mahmud



Abstract

Dependability analysis of a dynamic system which is embedded with several complex interrelated components raises two main problems. First, it is difficult to represent in a single coherent and complete picture how the system and its constituent parts behave in conditions of failure. Second, the analysis can be unmanageable due to a considerable number of failure events, which increases with the number of components involved. To remedy this problem, in this paper we outline an analysis approach that converts failure behavioural models (state machines) to temporal fault trees (TFTs), which can then be analysed using Pandora -- a recent technique for introducing temporal logic to fault trees. The approach is compositional and potentially more scalable, as it relies on the synthesis of large system TFTs from smaller component TFTs. We show, by using a Generic Triple Redundant (GTR) system, how the approach enables a more accurate and full analysis of an increasingly complex system.

Journal Article Type Article
Publication Date Apr 9, 2012
Journal Performance evaluation review
Print ISSN 0163-5999
Publisher Association for Computing Machinery (ACM)
Peer Reviewed Peer Reviewed
Volume 39
Issue 4
Pages 79-88
APA6 Citation Papadopoulos, Y., Walker, M., & Mahmud, N. (2012). Compositional synthesis of temporal fault trees from state machines. Performance Evaluation Review, 39(4), 79-88. doi:10.1145/2185395.2185444
DOI https://doi.org/10.1145/2185395.2185444
Keywords Computer Networks and Communications; Hardware and Architecture; Software
Publisher URL http://dl.acm.org/citation.cfm?doid=2185395.2185444
Copyright Statement ©2017 University of Hull
Additional Information Authors' accepted manuscript of article published in: Performance evaluation review, 2012, v.39, issue 4

Files



You might also like



Downloadable Citations

;