izvorni znanstveni rad
The fault trees can be very economically encoded by means of ROBDDs. Besides that it is well known that the probabilities of the top event can be computed from the ROBDD encoding the initial fault tree by simple recursive algorithm. It is our intention to show that it is possible to get different kinds of approximations of the probability of the top event when the ROBDD representation is used for the minimal cut set. In our test examples we will show that these differences can be significant, and that this type of calculations should be taken carefully.
fault tree; probability
Razvojem virtualizacijskih tehnologija raste kompleksnost IT sustava, dok korisnici istovremeno zahtijevaju brži pristup resursima, napredne integracije i jednostavnost korištenja. Jedno od ključnih rješenja za ove izazove primjena je…
Ovaj rad istražuje i uspoređuje mogućnosti prosljeđivanja grafičkih kartica na Hyper-V i KVM hipervizorima prema virtualnim strojevima, detaljno opisujući metode, postupke i razlike u arhitekturi koje utječu na…
The ever-growing usage and adaptation of HTTP/3 in web traffic leverages Quick UDP Internet Connections (QUIC) as a transport protocol. QUIC is widely recognized for reduced latency, enhanced…
