A translation of state machines to temporal fault trees

Mahmud, Nidhal; Papadopoulos, Yiannis; Walker, Martin

Abstract

State Machines (SMs) are increasingly being used to gain a better understanding of the failure behaviour of safety-critical systems. In dependability analysis, SMs are translated to other models, such as Generalized Stochastic Petri Nets (GSPNs) or combinatorial fault trees. The former does not enable qualitative analysis, whereas the second allows it but can lead to inaccurate or erroneous results, because combinatorial fault trees do not capture the temporal semantics expressed by SMs. In this paper, we discuss the problem and propose a translation of SMs to temporal fault trees using Pandora, a recent technique for introducing temporal logic to fault trees, thus preserving the significance of the temporal sequencing of faults and allowing full qualitative analysis. Since dependability models inform the design of condition monitoring and failure prevention measures, improving the representation and analysis of dynamic effects in such models can have a positive impact on proactive failure avoidance.

Citation

Papadopoulos, Y., Mahmud, N., & Walker, M. (2010). A translation of state machines to temporal fault trees. doi:10.1109/dsnw.2010.5542620

• Conference Name: 2010 International Conference on Dependable Systems and Networks Workshops (DSN-W)
• Start Date: Jun 28, 2010
• End Date: Jul 1, 2010
• Acceptance Date: Jan 1, 2010
• Publication Date: 2010-06
• Journal: Proceedings of the International Conference on Dependable Systems and Networks
• Pages: 45 - 51
• ISBN: 9781424477296
• DOI: https://doi.org/10.1109/dsnw.2010.5542620
• Keywords: Fault trees
• Public URL: https://hull-repository.worktribe.com/output/405519
• Publisher URL: https://ieeexplore.ieee.org/document/5542620/