skip to main content
10.1145/1772630.1772634acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedccConference Proceedingsconference-collections
research-article

A hierarchical method for the reduction of temporal expressions in Pandora

Published:27 April 2010Publication History

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.

References

  1. 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 ScholarGoogle Scholar
  2. 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 ScholarGoogle Scholar
  3. Walker, M. 2009. Pandora -- A Logic for the Qualitative Analysis of Temporal Fault Trees. PhD Thesis, University of Hull, UK.Google ScholarGoogle Scholar
  4. 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 ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A hierarchical method for the reduction of temporal expressions in Pandora

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        DYADEM-FTS '10: Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems
        April 2010
        45 pages
        ISBN:9781605589169
        DOI:10.1145/1772630
        • Conference Chair:
        • Arndt Bode

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 27 April 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader