9.3. References 193 Kordy, B., L. Piètre-Cambacédès, and P. Schweitzer (2014). “DAG-based attack and defense modeling: Don’t miss the forest for the attack trees”. In: Computer Science Review 13-14.C, pp. 1–38. doi: 10.1016/j.cosrev.2014.07.001. Kozine, I. and L. Utkin (Apr. 2002). “Interval-Valued Finite Markov Chains”. In: Reliable Computing 8, pp. 97–113. doi: 10.1023/A:1014745904458. Linardatos, P., V. Papastefanopoulos, and S. Kotsiantis (2021). “Explainable AI: A Review of Machine Learning Interpretability Methods”. In: Entropy 23.1. issn: 1099-4300. doi: 10.3390/e23010018. Ruijters, E. and M. Stoelinga (2015). “Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools”. In: Computer Science Review 15-16, pp. 29–62. issn: 1574-0137. doi: https://doi.org/10.1016/j.cosrev.2015.03.001. Sproston, J. (2023). “Qualitative reachability for open interval Markov chains”. In: PeerJ Computer Science 9, e1489. doi: 10.7717/peerj-cs.1489.
RkJQdWJsaXNoZXIy MjY0ODMw