ABSTRACT
Fault Tree Analysis (FTA) is a popular safety analysis technique used to determine the logical combination of events needed to cause a particular system failure. However, FTA is purely combinatorial and cannot analyse the effects of sequences of events. A recent technique named Pandora was proposed as one method of overcoming this limitation by introducing a temporal logic to fault trees, but the resulting expressions are generally more complex. In this paper, we propose a hierarchical method for reducing these expressions to simpler logical equivalents, which can be more easily understood and thus provide a better view of the system failure behaviour.
- Vesely, W. E., Goldberg F. F., Roberts N. H., Haasl D. F. 1981. Fault Tree Handbook. US Nuclear Regulatory Commission, Washington D.C., USA.Google Scholar
- Vesely, W. E., Stamatelatos, M., Dugan, J. B., Fragola J., Minarick J., Railsback, J. 2002. Fault Tree Handbook with Aerospace Applications. NASA Office of Safety and Mission Assurance, USA.Google Scholar
- Walker, M. 2009. Pandora -- A Logic for the Qualitative Analysis of Temporal Fault Trees. PhD Thesis, University of Hull, UK.Google Scholar
- Papadopoulos, Y., McDermid, J. A., Sasse R., and Heiner, G. 2001. Analysis and Synthesis of the Behaviour of Complex Systems in Conditions of Failure. Reliability Engineering and System Safety, 71(3):229--247.Google ScholarCross Ref
- Sullivan, K., Dugan, J., Coppit, D. 1999. The Galileo Fault Tree Analysis Tool. In Proceedings of the IEEE International Symposium of Fault Tolerant Computing, FTC'99, June 1999, pp. 232--235. Google ScholarDigital Library
- Walker, M., Bottaci, L., Papadopoulos, Y. 2007. Compositional Temporal Fault Tree Analysis. In Computer Safety, Reliability, and Security -- SAFECOMP'07, Saglietti, Oster, Norbert (eds), Lecture Notes in Computer Science 4680:105--119, Springer. ISBN 978-3-540-75100-7 Google ScholarDigital Library
- On-line Encyclopedia of Integer Sequences. A000670: Number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements. {Online} http://www.research.att.com/~njas/sequences/A000670 {Accessed April 2007}Google Scholar
- Dutuit, Y., and Rauzy, A. 1996. A linear-time algorithm to find modules of fault trees. IEEE Transactions on Reliability, Sept 1996, Volume R-45/3, pp 422--425.Google ScholarCross Ref
Index Terms
A hierarchical method for the reduction of temporal expressions in Pandora
Recommendations
Modeling Guidelines and Usage Analysis Towards Applying HiP-HOPS Method to Airborne Electrical Systems
SAFECOMP 2015: Proceedings of the 34th International Conference on Computer Safety, Reliability, and Security - Volume 9337Aircraft development process requires safety assessment to ensure aircraft continued airworthiness by guaranteeing that hazards related to aircraft functions are properly addressed. Safety analyses require increasingly more reliable and efficient ...
Monodic temporal resolution
Until recently, First-Order Temporal Logic (FOTL) has been only partially understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However, a ...
Reified Temporal Logics: An Overview
There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal ...
Comments