Advertisement

Validating Safety Models with Fault Trees

  • Glenn Bruns
  • Stuart Anderson
Conference paper

Abstract

In verifying a safety-critical system, one usually begins by building a model of the basic system and of its safety mechanisms. If the basic system model does not reflect reality, the verification results are misleading. We show how a model of a system can be compared with the system’s fault trees to help validate the failure behaviour of the model. To do this, the meaning of fault trees are formalised in temporal logic and a consistency relation between models and fault trees is defined. An important practical feature of the technique is that it allows models and fault trees to be compared even if some events in the fault tree are not found in the system model.

Keywords

System Fault Temporal Logic Fault Tree Atomic Proposition Component Failure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.E. Bloomfield, J.H. Cheng, and J. Gorski. Towards a common safety description model. In J.F. Lindeberg, editor, SAFECOMP ’91, 1991.CrossRefGoogle Scholar
  2. 2.
    J.C. Bradfield. A proof assistand for symbolic model checking. In Proceedings of CAV ’92, 1992.Google Scholar
  3. 3.
    Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. Technical Report ECS-LFCS-89-83, Laboratory for Foundations of Computer Science, University of Edinburgh, 1989.Google Scholar
  4. 4.
    D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983.MathSciNetCrossRefGoogle Scholar
  5. 5.
    N.H. Roberts, W.E. Vesely, D.F. Haasl, and F.F. Goldberg. Fault Tree Handbook. U.S. Nuclear Regulatory Commission, 1981.Google Scholar
  6. 6.
    C. Stirling. Temporal logics for CCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models. Springer Verlag, 1989. Lecture Notes in Computer Science, 354.Google Scholar

Copyright information

© Springer-Verlag London Limited 1993

Authors and Affiliations

  • Glenn Bruns
    • 1
  • Stuart Anderson
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghUK

Personalised recommendations