Advertisement

Formal Verification of Rewriting Rules for Dynamic Fault Trees

  • Yassmeen ElderhalliEmail author
  • Matthias Volk
  • Osman Hasan
  • Joost-Pieter Katoen
  • Sofiène Tahar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11724)

Abstract

Dynamic Fault Trees (DFTs) model the failure behavior of systems dynamics. Several rewriting rules have been recently developed, which allow the simplification of DFTs prior to a formal analysis with tools such as the Storm model checker. To ascertain the soundness of the analysis, we propose to formally verify these rewriting rules using higher-order-logic (HOL) theorem proving. We first present the formalization in HOL of commonly used DFT gates, i.e., AND, OR and PAND, with an arbitrary number of inputs. Then we describe our formal specification of the rewriting rules and the verification of their intended behavior using the HOL4 theorem prover.

Keywords

Dynamic Fault Trees Rewriting rules Theorem proving HOL4 

Notes

Acknowledgments

The authors would like to thank Sebastian Junges, from RWTH Aachen University, for the discussions and comments on the rewrite rules.

References

  1. 1.
    Boudali, H., Crouzen, P., Stoelinga, M.: Dynamic fault tree analysis using input/output interactive Markov chains. In: Proceedings of DSN, pp. 708–717. IEEE (2007)Google Scholar
  2. 2.
    Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A Storm is coming: a modern probabilistic model checker. In: Majumdar, R., Kunčak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 592–600. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-63390-9_31CrossRefGoogle Scholar
  3. 3.
    Dugan, J.B., Bavuso, S.J., Boyd, M.A.: Fault trees and sequence dependencies. In: Proceedings of RAMS, pp. 286–293 (1990)Google Scholar
  4. 4.
    Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006).  https://doi.org/10.1007/3-540-31188-2CrossRefzbMATHGoogle Scholar
  5. 5.
    Elderhalli, Y.: DFT rewriting rules: HOL4 script, Concordia University, Montreal, QC, Canada (2019). http://hvg.ece.concordia.ca/code/hol/DFT-rewrite/index.php
  6. 6.
    Elderhalli, Y., Ahmad, W., Hasan, O., Tahar, S.: Probabilistic analysis of dynamic fault trees using HOL theorem proving. J. Appl. Log. 6, 467–509 (2019)Google Scholar
  7. 7.
    Elderhalli, Y., Hasan, O., Ahmad, W., Tahar, S.: Formal dynamic fault trees analysis using an integration of theorem proving and model checking. In: Dutle, A., Muñoz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 139–156. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-77935-5_10CrossRefGoogle Scholar
  8. 8.
    Ghadhab, M., Junges, S., Katoen, J., Kuntz, M., Volk, M.: Safety analysis for vehicle guidance systems with dynamic fault trees. Reliab. Eng. Syst. Saf. 186, 37–50 (2019)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Junges, S., Guck, D., Katoen, J., Rensink, A., Stoelinga, M.: Fault trees on a diet: automated reduction by graph rewriting. Form. Asp. Comput. 29(4), 651–703 (2017)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Junges, S.: Simplifying dynamic fault trees by graph rewriting. Master thesis, RWTH Aachen University (2015)Google Scholar
  12. 12.
    Merle, G.: Algebraic modelling of dynamic fault trees, contribution to qualitative and quantitative analysis. Ph.D. thesis, ENS Cachan, France (2010)Google Scholar
  13. 13.
    Mhamdi, T., Hasan, O., Tahar, S.: On the formalization of the lebesgue integration theory in HOL. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 387–402. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-14052-5_27CrossRefGoogle Scholar
  14. 14.
    Mhamdi, T., Hasan, O., Tahar, S.: Formalization of entropy measures in HOL. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 233–248. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22863-6_18CrossRefGoogle Scholar
  15. 15.
    Ruijters, E., Stoelinga, M.: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools. Comput. Sci. Rev. 15–16, 29–62 (2015)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Stamatelatos, M., Vesely, W., Dugan, J., Fragola, J., Minarick, J., Railsback, J.: Fault Tree Handbook with Aerospace Applications. NASA Office of Safety and Mission Assurance (2002)Google Scholar
  17. 17.
    Volk, M., Junges, S., Katoen, J.P.: Fast dynamic fault tree analysis by model checking techniques. IEEE Trans. Ind. Inform. 14(1), 370–379 (2018)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Yassmeen Elderhalli
    • 1
    Email author
  • Matthias Volk
    • 2
  • Osman Hasan
    • 1
  • Joost-Pieter Katoen
    • 2
  • Sofiène Tahar
    • 1
  1. 1.Electrical and Computer EngineeringConcordia UniversityMontréalCanada
  2. 2.Software Modeling and VerificationRWTH Aachen UniversityAachenGermany

Personalised recommendations