论文信息 - Exploiting Pessimism for Fault Tree Completeness - 字舞流文

Exploiting Pessimism for Fault Tree Completeness

Florian Holzapfel | Alexander Wille

[1] Thomas A. Henzinger,et al. The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[2] Antoine Rauzy,et al. New algorithms for fault trees analysis , 1993 .

[3] A. Rauzy,et al. Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia , 1997 .

[4] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5] Olivier Coudert,et al. Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[6] Thomas A. Henzinger,et al. Theory in practice for system design and verification , 2015, SIGL.

[7] John D. Andrews,et al. Birnbaum's measure of component importance for noncoherent systems , 2003, IEEE Trans. Reliab..

[8] Jaejoo Ha,et al. A fast BDD algorithm for large coherent fault trees analysis , 2004, Reliab. Eng. Syst. Saf..