Abstract
An efficient generalization of Shanthikumar's upper bound on two-terminal reliability is developed, that leads to efficient methods for the probabilistic assessment of damage from fire spread and other invasive hazards in segmented structures. The methods exploit a basic relationship between the fire spread problem and the probability of reachability in communications networks. The upper bound employs noncrossing cuts of the network.
Similar content being viewed by others
References
H.M.F. AboElFotoh and C.J. Colbourn, Computing 2-terminal reliability for radio broadcast networks, IEEE Trans. Reliability R-38(1989)538–555.
H.M.F. AboElFotoh and C.J. Colbourn, Efficient algorithms for computing the reliability of permutation and interval graphs, Networks 20(1990)883–898.
M.O. Ball, J.S. Provan and D.R. Shier, Reliability covering problems, Networks 21(1991)345–358.
T.B. Boffey,Graph Theory in Operations Research (Macmillan, 1982).
B.M. Cohn, Formulating acceptable levels of fire risk, in:Fire Risk Assessment (Amer. Soc. Testing and Materials, 1982) pp. 28–37.
B.M. Cohn, A fire loss modeling code for industrial facilities, in:Mathematical Modeling of Fires, (Amer. Soc. Testing and Materials, 1988) pp. 58–67.
C.J. Colbourn,The Combinatorics of Network Reliability (Oxford University Press, 1987).
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).
D. Gross, Aspects of stochastic modeling for fire safety, Fire Technol. 19(1982)103–114.
D.D. Harms, A symbolic algebra environment for research in network reliability, Ph.D. Thesis, Computing Science, Simon Fraser University (1992).
D.D. Harms and C.J. Colbourn, Renormalization of two-terminal network reliability, Networks 23(1993)289–297.
W.C.T. Ling and R.B. Williamson, Using fire tests for quantitative risk analysis, in:Fire Risk Assessment (Amer. Soc. Testing and Materials, 1982). pp. 38–58.
M.V. Lomonosov, Bernoulli scheme with closure, Prob. Inf. Transmission 10(1974)73–81.
H. Nakazawa, Equivalence of a nonoriented line and a pair of oriented lines in a network, IEEE Trans. Reliability R-28(1979)364–367.
J.S. Provan, The complexity of reliability computations on planar and acyclic graphs, SIAM J. Comp. 15(1986)694–702.
G. Ramachandran, Stochastic modeling of fire growth, in:Fire Safety: Science and Engineering (Amer. Soc. Testing and Materials, 1985) pp. 122–144.
G. Ramachandran, Probabilistic approach to fire risk evaluation, Fire Technol. 24(1988)204–226.
J.G. Shanthikumar, Bounding network reliability using consecutive minimal cutsets, IEEE Trans. Reliability R-37(1988)45–49.
H. Takeda, Transient model of early stages in compartment fires, in:Mathematical Modeling of Fires (Amer. Soc. Testing and Materials, 1988) pp. 21–34.
D. Vertigan, The computational complexity of Tutte invariants for planar graphs, SIAM J. Comp., to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Colbourn, C.J., Nel, L.D., Boffey, T.B. et al. Network reliability and the probabilistic estimation of damage from fire spread. Ann Oper Res 50, 173–185 (1994). https://doi.org/10.1007/BF02085639
Issue Date:
DOI: https://doi.org/10.1007/BF02085639