Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem

•A novel binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the binary-state network reliability.•BAT outperforms path- and cut-based algorithms from the time complexity.•BAT outperforms QIE which is...

Full description

Saved in:
Bibliographic Details
Published inReliability engineering & system safety Vol. 208; p. 107448
Main Author Yeh, Wei-Chang
Format Journal Article
LanguageEnglish
Published Barking Elsevier Ltd 01.04.2021
Elsevier BV
Subjects
Algorithms
Binary addition
Binary-state network
Communication networks
Internet of Things
Layered-search algorithm
Network reliability
Reliability engineering
Search algorithms
Smart grid
Social networks
Social organization
State vectors
Structural reliability
System effectiveness
System reliability
Transportation networks
Wireless networks
Wireless sensor networks
Layered-search algorithm
Network reliability
Binary-state network
Binary addition
Online AccessGet full text
ISSN0951-8320
1879-0836
DOI10.1016/j.ress.2021.107448

Cover

Abstract •A novel binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the binary-state network reliability.•BAT outperforms path- and cut-based algorithms from the time complexity.•BAT outperforms QIE which is the best related algorithm from the experiments. Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.
AbstractList Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.
•A novel binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to calculate the binary-state network reliability.•BAT outperforms path- and cut-based algorithms from the time complexity.•BAT outperforms QIE which is the best related algorithm from the experiments. Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.
ArticleNumber 107448
Author Yeh, Wei-Chang
Author_xml – sequence: 1
  givenname: Wei-Chang
  surname: Yeh
  fullname: Yeh, Wei-Chang
  email: yeh@ieee.org
  organization: Department of Industrial Engineering and Engineering Management, National Tsing Hua University, P.O. Box 24-60, Hsinchu 300, Taiwan R.O.C
BookMark eNp9kE1LAzEQhoMoWKt_wNOCFz1snWQ_mgUvVfwC0UvFY8jOTjR1u6lJVPz3plQvHjwNDO8zw_vsse3BDcTYIYcJB16fLiaeQpgIEDwtpmUpt9iIy2mTgyzqbTaCpuK5LATssr0QFgBQNtV0xJ7u3Qf1WWsH7b9y3XU2Wjdk0RNlun923saXZXZ8PpufZMb532CIOlI2UPx0_jXz1Fvd2t7Gr2zlXdvTcp_tGN0HOviZY_Z4dTm_uMnvHq5vL2Z3ORZCxhwbwaU0nARi2kxRiLaTbW20wcqAbnUBhSmhrZtWdhIQNApAiQYxpYtizI42d9Pft3cKUS3cux_SSyUqEELIVDSlxCaF3oXgyaiVt8tURHFQa4FqodYC1Vqg2ghMkPwDoU21k57ote3_R882KKXqH5a8CmhpQOqsJ4yqc_Y__BtJvY9b
CitedBy_id crossref_primary_10_3390_app12146858
crossref_primary_10_1016_j_ress_2023_109806
crossref_primary_10_3390_electronics9081207
crossref_primary_10_1016_j_ress_2021_107883
crossref_primary_10_1016_j_ress_2022_108557
crossref_primary_10_1016_j_ress_2022_108954
crossref_primary_10_1016_j_ress_2024_109968
crossref_primary_10_1016_j_ress_2022_108795
crossref_primary_10_1016_j_ress_2021_107448
crossref_primary_10_1016_j_ress_2022_108796
crossref_primary_10_3390_electronics13030603
crossref_primary_10_1016_j_ress_2022_108435
crossref_primary_10_1016_j_ress_2023_109920
crossref_primary_10_1155_2021_6672630
crossref_primary_10_1093_jcde_qwad021
crossref_primary_10_1109_TR_2024_3354817
crossref_primary_10_3390_app12199514
crossref_primary_10_1016_j_ress_2024_110179
crossref_primary_10_3390_app112210765
crossref_primary_10_1016_j_ress_2022_108509
crossref_primary_10_1016_j_pnucene_2023_104983
crossref_primary_10_1016_j_ress_2022_108623
crossref_primary_10_3390_bdcc8090096
crossref_primary_10_3390_technologies11020050
crossref_primary_10_1016_j_ress_2021_107950
crossref_primary_10_1016_j_ress_2021_108167
crossref_primary_10_1016_j_ress_2025_110916
crossref_primary_10_1016_j_ress_2022_108687
crossref_primary_10_1016_j_ress_2023_109876
crossref_primary_10_1016_j_ress_2024_110774
crossref_primary_10_1093_jcde_qwab079
crossref_primary_10_1016_j_ress_2022_108881
crossref_primary_10_3390_app10238349
crossref_primary_10_1007_s10479_024_06409_3
crossref_primary_10_1016_j_ress_2025_110835
Cites_doi 10.1142/S0218539319500256
10.1016/j.ress.2019.106606
10.1109/TR.2007.911260
10.1016/j.ress.2014.11.010
10.1109/TR.2007.903290
10.1109/ACCESS.2017.2717452
10.1109/TR.2008.916871
10.3390/electronics9081207
10.1016/j.ress.2021.107448
10.1002/j.1538-7305.1959.tb01585.x
10.1016/j.ejor.2005.02.047
10.1016/0951-8320(88)90122-6
10.1109/TR.2017.2716183
10.1016/j.dam.2006.04.012
10.1002/qre.2097
10.1109/TR.2015.2452573
10.1016/j.future.2012.03.005
10.3390/app10238349
10.1109/TDSC.2017.2690293
10.1109/ACCESS.2019.2925044
10.1016/j.ress.2015.05.019
10.1109/TSMCA.2009.2026209
10.1007/s11227-016-1903-8
10.1109/TR.2016.2570552
10.1016/S0166-218X(99)00099-2
10.1016/j.ress.2015.04.013
10.1109/TNNLS.2016.2598562
10.1109/24.9868
10.1109/TSP.2014.2352606
10.1016/j.ress.2005.08.002
10.1109/24.756087
10.1109/TR.2017.2712667
10.1080/07408170601013653
10.1007/s11277-017-4711-4
10.1016/j.sbspro.2013.11.144
10.1016/j.ins.2019.02.004
10.1016/j.ress.2005.12.006
10.1016/j.camwa.2010.09.033
10.1016/0143-8174(87)90050-3
10.1007/s11518-017-5343-7
ContentType Journal Article
Copyright 2021 Elsevier Ltd
Copyright Elsevier BV Apr 2021
Copyright_xml – notice: 2021 Elsevier Ltd
– notice: Copyright Elsevier BV Apr 2021
DBID AAYXX
CITATION
7ST
7TB
8FD
C1K
FR3
SOI
DOI 10.1016/j.ress.2021.107448
DatabaseName CrossRef
Environment Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Environmental Sciences and Pollution Management
Engineering Research Database
Environment Abstracts
DatabaseTitle CrossRef
Engineering Research Database
Technology Research Database
Mechanical & Transportation Engineering Abstracts
Environment Abstracts
Environmental Sciences and Pollution Management
DatabaseTitleList Engineering Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1879-0836
ExternalDocumentID 10_1016_j_ress_2021_107448
S095183202100017X
GroupedDBID --K
--M
.~1
0R~
123
1B1
1~.
1~5
29P
4.4
457
4G.
5VS
7-5
71M
8P~
9JN
9JO
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
ABEFU
ABFNM
ABJNI
ABMAC
ABMMH
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACIWK
ACNNM
ACRLP
ADBBV
ADEZE
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFRAH
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PRBVW
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SET
SEW
SPC
SPCBC
SSB
SSO
SST
SSZ
T5K
TN5
WUQ
XPP
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7ST
7TB
8FD
AGCQF
C1K
FR3
SOI
ID FETCH-LOGICAL-c328t-c92188f1e2ccc327c22bd8b6fafc5f0aba303f40b69b8d80c0ac20c8cfcc27c33
IEDL.DBID .~1
ISSN 0951-8320
IngestDate Wed Aug 13 06:50:15 EDT 2025
Sat Oct 25 05:44:38 EDT 2025
Thu Apr 24 22:55:03 EDT 2025
Fri Feb 23 02:45:32 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Layered-search algorithm
Network reliability
Binary-state network
Binary addition
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c328t-c92188f1e2ccc327c22bd8b6fafc5f0aba303f40b69b8d80c0ac20c8cfcc27c33
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2502228049
PQPubID 2045406
ParticipantIDs proquest_journals_2502228049
crossref_primary_10_1016_j_ress_2021_107448
crossref_citationtrail_10_1016_j_ress_2021_107448
elsevier_sciencedirect_doi_10_1016_j_ress_2021_107448
PublicationCentury 2000
PublicationDate April 2021
2021-04-00
20210401
PublicationDateYYYYMMDD 2021-04-01
PublicationDate_xml – month: 04
  year: 2021
  text: April 2021
PublicationDecade 2020
PublicationPlace Barking
PublicationPlace_xml – name: Barking
PublicationTitle Reliability engineering & system safety
PublicationYear 2021
Publisher Elsevier Ltd
Elsevier BV
Publisher_xml – name: Elsevier Ltd
– name: Elsevier BV
References Yeh (bib0028) 2009; 39
Coit, Zio (bib0007) 2018
Forghani-Elahabad, Kagan (bib0009) 2019; 26
Kabadurmus, Smith (bib0041) 2018; 67
Yeh (bib0042) 2006; 91
Ahmad (bib0001) 1988; 37
Yeh (bib0024) 2006; 174
Yeh, W.-C. (2020). Novel bounded binary-addition tree algorithm for binary-state network reliability problems. arXiv preprint arXiv
Yeh (bib0027) 2008; 57
Niu, Shao (bib0018) 2011; 61
Laitrakun, Coyle (bib0012) 2014; 62
Zuo, Tian, Huang (bib0036) 2007; 39
Levitin, Xing, Dai (bib0015) 2017; 16
Yeh (bib0031) 2016; 28
Niu, Gao, Sun (bib0017) 2017; 26
Gurvich, Khachiyan (bib0039) 1999; 96-97
Ramirez-Marquez (bib0019) 2015; 142
Yeh (bib0026) 2007; 56
Bai, Zuo, Tian (bib0004) 2015; 142
Su (bib0047) 2020; 9
Levitin (bib0014) 2005
Colbourn (bib0008) 1987
Hao, Yeh, Wang, Wang, Sun (bib0010) 2019; 486
.
Aven (bib0002) 1987; 18
Kvassay, Levashenko, Zaitseva (bib0037) 2016; 230
Bryant (bib0006) 1986; 100
Yeh, Wei (bib0034) 2012; 28
Yeh (bib0050) 2020
Khachiyan, Boros, Elbassioni, Gurvich (bib0038) 2006; 154
Yeh, Kuo (bib0045) 2020; 10
Yeh, Hao, Forghani-elahabad, Wang, Lin (bib0048) 2020
Yeh (bib0023) 1998; 47
Wang, Xing, Wang, Coit (bib0022) 2017; 67
Yeh (bib0030) 2016; 65
Wang, Yeh, Xiong, Wang, He, Huang (bib0021) 2019; 7
Yeh (bib0025) 2007; 92
Yeh, Bae, Huang (bib0044) 2015; 136
Shier (bib0020) 1991
Yeh (bib0046) 2020
Yeh (bib0043) 2008; 57
Yeh (bib0029) 2015; 64
Lee (bib0013) 1959; 38
Yeh, Lin (bib0033) 2018; 74
Yeh, W.-C. (2019). A novel generalized artificial neural network for mining two-class datasets. arXiv preprint arXiv
Zhang, Ma, Shi, Wang, Cai, Liu (bib0035) 2017; 5
Bhavathrathan, Patil (bib0005) 2013; 104
Chakraborty, Goyal (bib0040) 2017; 33
Reliability Engineering & System Safety, under review.
Aven (bib0003) 1988; 21
Lin, Cui, Coit, Lv (bib0016) 2017; 97
Kakadia, Ramirez-Marquez (bib0011) 2020; 193
Bryant (10.1016/j.ress.2021.107448_bib0006) 1986; 100
Bhavathrathan (10.1016/j.ress.2021.107448_bib0005) 2013; 104
Yeh (10.1016/j.ress.2021.107448_bib0026) 2007; 56
Shier (10.1016/j.ress.2021.107448_bib0020) 1991
Colbourn (10.1016/j.ress.2021.107448_bib0008) 1987
Niu (10.1016/j.ress.2021.107448_bib0017) 2017; 26
Yeh (10.1016/j.ress.2021.107448_bib0028) 2009; 39
Yeh (10.1016/j.ress.2021.107448_bib0031) 2016; 28
Coit (10.1016/j.ress.2021.107448_bib0007) 2018
Chakraborty (10.1016/j.ress.2021.107448_bib0040) 2017; 33
Yeh (10.1016/j.ress.2021.107448_bib0042) 2006; 91
Hao (10.1016/j.ress.2021.107448_bib0010) 2019; 486
Bai (10.1016/j.ress.2021.107448_bib0004) 2015; 142
Gurvich (10.1016/j.ress.2021.107448_bib0039) 1999; 96-97
10.1016/j.ress.2021.107448_bib0049
Forghani-Elahabad (10.1016/j.ress.2021.107448_bib0009) 2019; 26
Zuo (10.1016/j.ress.2021.107448_bib0036) 2007; 39
Wang (10.1016/j.ress.2021.107448_bib0022) 2017; 67
Aven (10.1016/j.ress.2021.107448_bib0002) 1987; 18
Yeh (10.1016/j.ress.2021.107448_bib0030) 2016; 65
Su (10.1016/j.ress.2021.107448_bib0047) 2020; 9
Yeh (10.1016/j.ress.2021.107448_bib0048) 2020
Yeh (10.1016/j.ress.2021.107448_bib0023) 1998; 47
Kabadurmus (10.1016/j.ress.2021.107448_bib0041) 2018; 67
Yeh (10.1016/j.ress.2021.107448_bib0033) 2018; 74
Levitin (10.1016/j.ress.2021.107448_bib0014) 2005
Yeh (10.1016/j.ress.2021.107448_bib0050) 2020
Kakadia (10.1016/j.ress.2021.107448_bib0011) 2020; 193
Yeh (10.1016/j.ress.2021.107448_bib0043) 2008; 57
Niu (10.1016/j.ress.2021.107448_bib0018) 2011; 61
10.1016/j.ress.2021.107448_bib0032
Wang (10.1016/j.ress.2021.107448_bib0021) 2019; 7
Yeh (10.1016/j.ress.2021.107448_bib0029) 2015; 64
Lin (10.1016/j.ress.2021.107448_bib0016) 2017; 97
Laitrakun (10.1016/j.ress.2021.107448_bib0012) 2014; 62
Yeh (10.1016/j.ress.2021.107448_bib0034) 2012; 28
Yeh (10.1016/j.ress.2021.107448_bib0044) 2015; 136
Yeh (10.1016/j.ress.2021.107448_bib0045) 2020; 10
Yeh (10.1016/j.ress.2021.107448_bib0027) 2008; 57
Khachiyan (10.1016/j.ress.2021.107448_bib0038) 2006; 154
Ramirez-Marquez (10.1016/j.ress.2021.107448_bib0019) 2015; 142
Ahmad (10.1016/j.ress.2021.107448_bib0001) 1988; 37
Lee (10.1016/j.ress.2021.107448_bib0013) 1959; 38
Zhang (10.1016/j.ress.2021.107448_bib0035) 2017; 5
Yeh (10.1016/j.ress.2021.107448_bib0046) 2020
Aven (10.1016/j.ress.2021.107448_bib0003) 1988; 21
Yeh (10.1016/j.ress.2021.107448_bib0024) 2006; 174
Yeh (10.1016/j.ress.2021.107448_bib0025) 2007; 92
Kvassay (10.1016/j.ress.2021.107448_bib0037) 2016; 230
Levitin (10.1016/j.ress.2021.107448_bib0015) 2017; 16
References_xml – volume: 18
  start-page: 35
  year: 1987
  end-page: 44
  ident: bib0002
  article-title: Availability evaluation of oil/gas production and transportation systems
  publication-title: Reliab Eng
– volume: 67
  start-page: 26
  year: 2018
  end-page: 40
  ident: bib0041
  article-title: Evaluating reliability/survivability of capacitated wireless networks
  publication-title: IEEE Trans Reliab
– volume: 26
  start-page: 711
  year: 2017
  end-page: 731
  ident: bib0017
  article-title: An improved algorithm for solving all d-MPs in multi-state networks
  publication-title: J Syst Sci Syst Eng
– volume: 38
  start-page: 985
  year: 1959
  end-page: 999
  ident: bib0013
  article-title: Representation of switching circuits by binary-decision programs
  publication-title: Bell Syst Tech J
– volume: 67
  start-page: 416
  year: 2017
  end-page: 431
  ident: bib0022
  article-title: System reliability modeling considering correlated probabilistic competing failures
  publication-title: IEEE Trans Reliab
– volume: 16
  start-page: 301
  year: 2017
  end-page: 312
  ident: bib0015
  article-title: Optimal spot-checking for collusion tolerance in computer grids
  publication-title: IEEE Trans Dependable Secure Comput
– volume: 96-97
  start-page: 363
  year: 1999
  end-page: 373
  ident: bib0039
  article-title: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
  publication-title: Discr Appl Math
– volume: 64
  start-page: 1185
  year: 2015
  end-page: 1193
  ident: bib0029
  article-title: An improved sum-of-disjoint-products technique for symbolic multi-state flow network reliability
  publication-title: IEEE Trans Reliab
– volume: 104
  start-page: 507
  year: 2013
  end-page: 515
  ident: bib0005
  article-title: Analysis of worst case stochastic link capacity degradation to aid assessment of transportation network reliability
  publication-title: Procedia-Soc Behav Sci
– volume: 33
  start-page: 1067
  year: 2017
  end-page: 1082
  ident: bib0040
  article-title: An efficient reliability evaluation approach for networks with simultaneous multiple-node-pair flow requirements
  publication-title: Qual Reliab Eng Int
– volume: 28
  start-page: 2822
  year: 2016
  end-page: 2825
  ident: bib0031
  article-title: A squeezed artificial neural network for the symbolic network reliability functions of binary-state networks
  publication-title: IEEE Trans Neural Netw Learn Syst
– volume: 7
  start-page: 141728
  year: 2019
  end-page: 141737
  ident: bib0021
  article-title: Building an improved Internet of things smart sensor network based on a three-phase methodology
  publication-title: IEEE Access
– year: 1987
  ident: bib0008
  article-title: The combinatorics of network reliability
– volume: 65
  start-page: 1263
  year: 2016
  end-page: 1270
  ident: bib0030
  article-title: New method in searching for all minimal paths for the directed acyclic network reliability problem
  publication-title: IEEE Trans Reliab
– volume: 97
  start-page: 3993
  year: 2017
  end-page: 4013
  ident: bib0016
  article-title: Performance analysis for a wireless sensor network of star topology with random nodes deployment
  publication-title: Wirel Pers Commun
– year: 2020
  ident: bib0048
  article-title: Novel binary-addition tree algorithm for reliability evaluation of acyclic multistate information networks
– year: 2018
  ident: bib0007
  article-title: The evolution of system reliability optimization
  publication-title: Reliab Eng Syst Saf
– reference: Yeh, W.-C. (2020). Novel bounded binary-addition tree algorithm for binary-state network reliability problems. arXiv preprint arXiv:
– volume: 47
  start-page: 436
  year: 1998
  end-page: 442
  ident: bib0023
  article-title: A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
  publication-title: IEEE Trans Reliab
– volume: 5
  start-page: 12449
  year: 2017
  end-page: 12457
  ident: bib0035
  article-title: Reliability oriented modeling and analysis of vehicular power line communication for vehicle to grid (V2G) information exchange system
  publication-title: IEEE Access
– volume: 56
  start-page: 488
  year: 2007
  end-page: 494
  ident: bib0026
  article-title: A simple heuristic algorithm for generating all minimal paths
  publication-title: IEEE Trans Reliab
– volume: 486
  start-page: 20
  year: 2019
  end-page: 30
  ident: bib0010
  article-title: A quick inclusion-exclusion technique
  publication-title: Inf Sci
– volume: 230
  start-page: 147
  year: 2016
  end-page: 161
  ident: bib0037
  article-title: Analysis of minimal cut and path sets based on direct partial Boolean derivatives
  publication-title: Proc Inst Mech Eng, Part O
– volume: 57
  start-page: 94
  year: 2008
  end-page: 102
  ident: bib0043
  article-title: The extension of universal generating function method to search for all one-to-many d-minimal paths of acyclic multi-state-arc flow-conservation networks
  publication-title: IEEE Trans Reliab
– volume: 62
  start-page: 5536
  year: 2014
  end-page: 5551
  ident: bib0012
  article-title: Reliability-based splitting algorithms for time-constrained distributed detection in random-access WSNs
  publication-title: IEEE Trans Signal Process
– volume: 10
  start-page: 8349
  year: 2020
  ident: bib0045
  article-title: Predicting and modeling wildfire propagation areas with BAT and maximum-state PageRank
  publication-title: Appl Sci
– reference: , Reliability Engineering & System Safety, under review.
– volume: 92
  start-page: 260
  year: 2007
  end-page: 268
  ident: bib0025
  article-title: An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths
  publication-title: Reliab Eng Syst Saf
– volume: 21
  start-page: 215
  year: 1988
  end-page: 223
  ident: bib0003
  article-title: Some considerations on reliability theory and its applications
  publication-title: Reliab Eng Syst Saf
– volume: 174
  start-page: 1694
  year: 2006
  end-page: 1705
  ident: bib0024
  article-title: A simple algorithm to search for all MCs in networks
  publication-title: Eur J Oper Res
– volume: 57
  start-page: 88
  year: 2008
  end-page: 93
  ident: bib0027
  article-title: A greedy branch-and-bound inclusion-exclusion algorithm for calculating the exact multi-state network reliability
  publication-title: IEEE Trans Reliab
– year: 2020
  ident: bib0050
  article-title: One-batch preempt multi-state multi-rework network reliability problem
– volume: 37
  start-page: 484
  year: 1988
  end-page: 487
  ident: bib0001
  article-title: Simple enumeration of minimal cutsets of acyclic directed graph
  publication-title: IEEE Trans Reliab
– volume: 39
  start-page: 811
  year: 2007
  end-page: 817
  ident: bib0036
  article-title: An efficient method for reliability evaluation of multistate networks given all minimal path vectors
  publication-title: IIE Trans
– volume: 142
  start-page: 212
  year: 2015
  end-page: 220
  ident: bib0019
  article-title: Assessment of the transition-rates importance of Markovian systems at steady state using the unscented transformation
  publication-title: Reliab Eng Syst Saf
– volume: 61
  start-page: 2241
  year: 2011
  end-page: 2246
  ident: bib0018
  article-title: A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
  publication-title: Comput Math Appl
– volume: 28
  start-page: 989
  year: 2012
  end-page: 1002
  ident: bib0034
  article-title: Economic-based resource allocation for reliable Grid-computing service based on Grid Bank
  publication-title: Fut Gener Comput Syst
– volume: 136
  start-page: 1
  year: 2015
  end-page: 7
  ident: bib0044
  article-title: A new cut-based algorithm for the multi-state flow network reliability problem
  publication-title: Reliab Eng Syst Saf
– reference: Yeh, W.-C. (2019). A novel generalized artificial neural network for mining two-class datasets. arXiv preprint arXiv:
– volume: 154
  start-page: 2350
  year: 2006
  end-page: 2372
  ident: bib0038
  article-title: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
  publication-title: Discr Appl Math
– volume: 9
  start-page: 1207
  year: 2020
  ident: bib0047
  article-title: Binary-addition tree algorithm-based resilience assessment for binary-state network problems
  publication-title: Electronics
– year: 1991
  ident: bib0020
  article-title: Network reliability and algebraic structures
– reference: .
– volume: 74
  start-page: 4358
  year: 2018
  end-page: 4384
  ident: bib0033
  article-title: New parallel swarm algorithm for smart sensor systems redundancy allocation problems in the Internet of Things
  publication-title: J Supercomput
– volume: 26
  year: 2019
  ident: bib0009
  article-title: Assessing reliability of multistate flow networks under cost constraint in terms of minimal cuts
  publication-title: Int J Reliab Qual Saf Eng
– volume: 39
  start-page: 1247
  year: 2009
  end-page: 1254
  ident: bib0028
  article-title: A simple universal generating function method to search for all minimal paths in networks
  publication-title: IEEE Trans Syst, Man, Cybern-Part A
– volume: 100
  start-page: 677
  year: 1986
  end-page: 691
  ident: bib0006
  article-title: Graph-based algorithms for boolean function manipulation
  publication-title: IEEE Trans
– year: 2005
  ident: bib0014
  article-title: The universal generating function in reliability analysis and optimization
– volume: 142
  start-page: 300
  year: 2015
  end-page: 309
  ident: bib0004
  article-title: Search for all d-MPs for all d levels in multistate two-terminal networks
  publication-title: Reliab Eng Syst Saf
– volume: 91
  start-page: 800
  year: 2006
  end-page: 808
  ident: bib0042
  article-title: The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method
  publication-title: Reliab Eng Syst Saf
– year: 2020
  ident: bib0046
  article-title: Predicting spread probability of learning-effect computer virus
– volume: 193
  year: 2020
  ident: bib0011
  article-title: Quantitative approaches for optimization of user experience based on network resilience for wireless service provider networks
  publication-title: Reliab Eng Syst Saf
– volume: 26
  issue: 5
  year: 2019
  ident: 10.1016/j.ress.2021.107448_bib0009
  article-title: Assessing reliability of multistate flow networks under cost constraint in terms of minimal cuts
  publication-title: Int J Reliab Qual Saf Eng
  doi: 10.1142/S0218539319500256
– volume: 193
  year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0011
  article-title: Quantitative approaches for optimization of user experience based on network resilience for wireless service provider networks
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2019.106606
– volume: 57
  start-page: 94
  issue: 1
  year: 2008
  ident: 10.1016/j.ress.2021.107448_bib0043
  article-title: The extension of universal generating function method to search for all one-to-many d-minimal paths of acyclic multi-state-arc flow-conservation networks
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2007.911260
– volume: 136
  start-page: 1
  year: 2015
  ident: 10.1016/j.ress.2021.107448_bib0044
  article-title: A new cut-based algorithm for the multi-state flow network reliability problem
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2014.11.010
– ident: 10.1016/j.ress.2021.107448_bib0032
– year: 1991
  ident: 10.1016/j.ress.2021.107448_bib0020
– volume: 56
  start-page: 488
  issue: 3
  year: 2007
  ident: 10.1016/j.ress.2021.107448_bib0026
  article-title: A simple heuristic algorithm for generating all minimal paths
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2007.903290
– volume: 5
  start-page: 12449
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0035
  article-title: Reliability oriented modeling and analysis of vehicular power line communication for vehicle to grid (V2G) information exchange system
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2017.2717452
– volume: 57
  start-page: 88
  issue: 1
  year: 2008
  ident: 10.1016/j.ress.2021.107448_bib0027
  article-title: A greedy branch-and-bound inclusion-exclusion algorithm for calculating the exact multi-state network reliability
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2008.916871
– volume: 9
  start-page: 1207
  issue: 8
  year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0047
  article-title: Binary-addition tree algorithm-based resilience assessment for binary-state network problems
  publication-title: Electronics
  doi: 10.3390/electronics9081207
– ident: 10.1016/j.ress.2021.107448_bib0049
  doi: 10.1016/j.ress.2021.107448
– volume: 38
  start-page: 985
  issue: 4
  year: 1959
  ident: 10.1016/j.ress.2021.107448_bib0013
  article-title: Representation of switching circuits by binary-decision programs
  publication-title: Bell Syst Tech J
  doi: 10.1002/j.1538-7305.1959.tb01585.x
– volume: 174
  start-page: 1694
  issue: 3
  year: 2006
  ident: 10.1016/j.ress.2021.107448_bib0024
  article-title: A simple algorithm to search for all MCs in networks
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2005.02.047
– volume: 21
  start-page: 215
  issue: 3
  year: 1988
  ident: 10.1016/j.ress.2021.107448_bib0003
  article-title: Some considerations on reliability theory and its applications
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/0951-8320(88)90122-6
– volume: 100
  start-page: 677
  issue: 8
  year: 1986
  ident: 10.1016/j.ress.2021.107448_bib0006
  article-title: Graph-based algorithms for boolean function manipulation
  publication-title: IEEE Trans
– volume: 67
  start-page: 416
  issue: 2
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0022
  article-title: System reliability modeling considering correlated probabilistic competing failures
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2017.2716183
– year: 1987
  ident: 10.1016/j.ress.2021.107448_bib0008
– year: 2018
  ident: 10.1016/j.ress.2021.107448_bib0007
  article-title: The evolution of system reliability optimization
  publication-title: Reliab Eng Syst Saf
– volume: 154
  start-page: 2350
  issue: 16
  year: 2006
  ident: 10.1016/j.ress.2021.107448_bib0038
  article-title: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
  publication-title: Discr Appl Math
  doi: 10.1016/j.dam.2006.04.012
– volume: 33
  start-page: 1067
  issue: 5
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0040
  article-title: An efficient reliability evaluation approach for networks with simultaneous multiple-node-pair flow requirements
  publication-title: Qual Reliab Eng Int
  doi: 10.1002/qre.2097
– volume: 230
  start-page: 147
  issue: 2
  year: 2016
  ident: 10.1016/j.ress.2021.107448_bib0037
  article-title: Analysis of minimal cut and path sets based on direct partial Boolean derivatives
  publication-title: Proc Inst Mech Eng, Part O
– volume: 64
  start-page: 1185
  issue: 4
  year: 2015
  ident: 10.1016/j.ress.2021.107448_bib0029
  article-title: An improved sum-of-disjoint-products technique for symbolic multi-state flow network reliability
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2015.2452573
– volume: 28
  start-page: 989
  issue: 7
  year: 2012
  ident: 10.1016/j.ress.2021.107448_bib0034
  article-title: Economic-based resource allocation for reliable Grid-computing service based on Grid Bank
  publication-title: Fut Gener Comput Syst
  doi: 10.1016/j.future.2012.03.005
– volume: 10
  start-page: 8349
  issue: 23
  year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0045
  article-title: Predicting and modeling wildfire propagation areas with BAT and maximum-state PageRank
  publication-title: Appl Sci
  doi: 10.3390/app10238349
– volume: 16
  start-page: 301
  issue: 2
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0015
  article-title: Optimal spot-checking for collusion tolerance in computer grids
  publication-title: IEEE Trans Dependable Secure Comput
  doi: 10.1109/TDSC.2017.2690293
– volume: 7
  start-page: 141728
  year: 2019
  ident: 10.1016/j.ress.2021.107448_bib0021
  article-title: Building an improved Internet of things smart sensor network based on a three-phase methodology
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2925044
– volume: 142
  start-page: 212
  year: 2015
  ident: 10.1016/j.ress.2021.107448_bib0019
  article-title: Assessment of the transition-rates importance of Markovian systems at steady state using the unscented transformation
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2015.05.019
– volume: 39
  start-page: 1247
  issue: 6
  year: 2009
  ident: 10.1016/j.ress.2021.107448_bib0028
  article-title: A simple universal generating function method to search for all minimal paths in networks
  publication-title: IEEE Trans Syst, Man, Cybern-Part A
  doi: 10.1109/TSMCA.2009.2026209
– volume: 74
  start-page: 4358
  issue: 9
  year: 2018
  ident: 10.1016/j.ress.2021.107448_bib0033
  article-title: New parallel swarm algorithm for smart sensor systems redundancy allocation problems in the Internet of Things
  publication-title: J Supercomput
  doi: 10.1007/s11227-016-1903-8
– volume: 65
  start-page: 1263
  issue: 3
  year: 2016
  ident: 10.1016/j.ress.2021.107448_bib0030
  article-title: New method in searching for all minimal paths for the directed acyclic network reliability problem
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2016.2570552
– volume: 96-97
  start-page: 363
  year: 1999
  ident: 10.1016/j.ress.2021.107448_bib0039
  article-title: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
  publication-title: Discr Appl Math
  doi: 10.1016/S0166-218X(99)00099-2
– volume: 142
  start-page: 300
  year: 2015
  ident: 10.1016/j.ress.2021.107448_bib0004
  article-title: Search for all d-MPs for all d levels in multistate two-terminal networks
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2015.04.013
– volume: 28
  start-page: 2822
  issue: 11
  year: 2016
  ident: 10.1016/j.ress.2021.107448_bib0031
  article-title: A squeezed artificial neural network for the symbolic network reliability functions of binary-state networks
  publication-title: IEEE Trans Neural Netw Learn Syst
  doi: 10.1109/TNNLS.2016.2598562
– year: 2005
  ident: 10.1016/j.ress.2021.107448_bib0014
– volume: 37
  start-page: 484
  issue: 5
  year: 1988
  ident: 10.1016/j.ress.2021.107448_bib0001
  article-title: Simple enumeration of minimal cutsets of acyclic directed graph
  publication-title: IEEE Trans Reliab
  doi: 10.1109/24.9868
– volume: 62
  start-page: 5536
  issue: 21
  year: 2014
  ident: 10.1016/j.ress.2021.107448_bib0012
  article-title: Reliability-based splitting algorithms for time-constrained distributed detection in random-access WSNs
  publication-title: IEEE Trans Signal Process
  doi: 10.1109/TSP.2014.2352606
– volume: 91
  start-page: 800
  issue: 7
  year: 2006
  ident: 10.1016/j.ress.2021.107448_bib0042
  article-title: The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2005.08.002
– year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0048
– volume: 47
  start-page: 436
  issue: 4
  year: 1998
  ident: 10.1016/j.ress.2021.107448_bib0023
  article-title: A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
  publication-title: IEEE Trans Reliab
  doi: 10.1109/24.756087
– volume: 67
  start-page: 26
  issue: 1
  year: 2018
  ident: 10.1016/j.ress.2021.107448_bib0041
  article-title: Evaluating reliability/survivability of capacitated wireless networks
  publication-title: IEEE Trans Reliab
  doi: 10.1109/TR.2017.2712667
– volume: 39
  start-page: 811
  issue: 8
  year: 2007
  ident: 10.1016/j.ress.2021.107448_bib0036
  article-title: An efficient method for reliability evaluation of multistate networks given all minimal path vectors
  publication-title: IIE Trans
  doi: 10.1080/07408170601013653
– volume: 97
  start-page: 3993
  issue: 3
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0016
  article-title: Performance analysis for a wireless sensor network of star topology with random nodes deployment
  publication-title: Wirel Pers Commun
  doi: 10.1007/s11277-017-4711-4
– volume: 104
  start-page: 507
  year: 2013
  ident: 10.1016/j.ress.2021.107448_bib0005
  article-title: Analysis of worst case stochastic link capacity degradation to aid assessment of transportation network reliability
  publication-title: Procedia-Soc Behav Sci
  doi: 10.1016/j.sbspro.2013.11.144
– volume: 486
  start-page: 20
  year: 2019
  ident: 10.1016/j.ress.2021.107448_bib0010
  article-title: A quick inclusion-exclusion technique
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2019.02.004
– volume: 92
  start-page: 260
  issue: 2
  year: 2007
  ident: 10.1016/j.ress.2021.107448_bib0025
  article-title: An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths
  publication-title: Reliab Eng Syst Saf
  doi: 10.1016/j.ress.2005.12.006
– year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0046
– volume: 61
  start-page: 2241
  issue: 8
  year: 2011
  ident: 10.1016/j.ress.2021.107448_bib0018
  article-title: A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
  publication-title: Comput Math Appl
  doi: 10.1016/j.camwa.2010.09.033
– volume: 18
  start-page: 35
  issue: 1
  year: 1987
  ident: 10.1016/j.ress.2021.107448_bib0002
  article-title: Availability evaluation of oil/gas production and transportation systems
  publication-title: Reliab Eng
  doi: 10.1016/0143-8174(87)90050-3
– volume: 26
  start-page: 711
  issue: 6
  year: 2017
  ident: 10.1016/j.ress.2021.107448_bib0017
  article-title: An improved algorithm for solving all d-MPs in multi-state networks
  publication-title: J Syst Sci Syst Eng
  doi: 10.1007/s11518-017-5343-7
– year: 2020
  ident: 10.1016/j.ress.2021.107448_bib0050
SSID ssj0004957
Score 2.5540636
Snippet •A novel binary-addition tree (BAT) algorithm is proposed.•BAT is simple to understand, easy to code, and flexible to made-to-fit.•A fast algorithm to...
Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks,...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 107448
SubjectTerms Algorithms
Binary addition
Binary-state network
Communication networks
Internet of Things
Layered-search algorithm
Network reliability
Reliability engineering
Search algorithms
Smart grid
Social networks
Social organization
State vectors
Structural reliability
System effectiveness
System reliability
Transportation networks
Wireless networks
Wireless sensor networks
Title Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem
URI https://dx.doi.org/10.1016/j.ress.2021.107448
https://www.proquest.com/docview/2502228049
Volume 208
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1879-0836
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004957
  issn: 0951-8320
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1879-0836
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004957
  issn: 0951-8320
  databaseCode: ACRLP
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection
  customDbUrl:
  eissn: 1879-0836
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004957
  issn: 0951-8320
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection Journals
  customDbUrl:
  eissn: 1879-0836
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004957
  issn: 0951-8320
  databaseCode: AIKHN
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1879-0836
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004957
  issn: 0951-8320
  databaseCode: AKRWK
  dateStart: 19880101
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqssCAeIpCqTwwgFBaJ3ESdywVVQHRhVZ0i2LHhqDQVlVAYuG344sdXkIdGOOcrejs3EP-7juETjzOAqrDWiclUeJQkTInYSxxlEs5CwMhPR8KhW9H4XBCr6fBtIb6VS0MwCqt7Tc2vbTWdqRjtdlZZFnnDoIDBu2_3ZL1ZQoV7DSCLgbt9y-Yh04AoqqdPEjbwhmD8YKMtg0rtAGXCD2A_nZOv8x06XsGW2jTBo24Z75rG9XkbAdtfKMS3EX3o_mrzDEvy2sdQAmBxjHcOeMkf5gvs-LxGZ9e9MZnWMeplWBZT4RnBguOlzLPDG_3G7adZvbQZHA57g8d2zTBEb7HCkd0tdNmypWeEHokEp7HU8ZDlSgRKJLwRDstRQkPu5yljAgCJI2CCSWElvb9fVSfzWfyAGGdSgC7DlFUJTSkkodMKo8TlxMONHMN5FbaioVlFIfGFnlcQceeYtBwDBqOjYYb6PxzzsLwaayUDqpNiH-cilgb_JXzmtWOxfaf1O8DSG6ZPhGH_1z2CK3DkwHuNFG9WL7IYx2TFLxVHroWWutd3QxHHxWX4OU
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZKGYAB8RSFAh4YQChtHk7ijqWiKtB2oRXdrNi1ISikVRWQWPjt-BKHlxADq322orN9D-W77xA6cTn1iQ5rrakdRhYRU2pFlEaWcgingS-k60Gh8GAY9MbkeuJPKqhT1sIArNLY_sKm59bajDSNNpvzOG7eQnBAof23k7O-TJbQMvHdEDKwxtsnzkNnAGHZTx7ETeVMAfKClLYBWzQAmAhNgH73Tj_sdO58uhto3USNuF182CaqyHQLrX3hEtxGd8PZi0wwz-trLYAJgcox_HTGUXI_W8TZwxM-vWiPzrAOVEvBvKAIpwUYHC9kEhfE3a_YtJrZQePu5ajTs0zXBEt4Ls0s0dJemypHukLokVC4Lp9SHqhICV_ZEY-011LE5kGL0ym1hQ0sjYIKJYSW9rxdVE1nqdxDWOcSQK9jK6IiEhDJAyqVy22H2xx45mrIKbXFhKEUh84WCSuxY48MNMxAw6zQcA2df6yZF4Qaf0r75SGwb9eCaYv_57p6eWLMPEo970N2S_WN2P_ntsdopTca9Fn_anhzgFZhpkDx1FE1WzzLQx2gZPwov4DvY2jieg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Novel+binary-addition+tree+algorithm+%28BAT%29+for+binary-state+network+reliability+problem&rft.jtitle=Reliability+engineering+%26+system+safety&rft.au=Yeh%2C+Wei-Chang&rft.date=2021-04-01&rft.issn=0951-8320&rft.volume=208&rft.spage=107448&rft_id=info:doi/10.1016%2Fj.ress.2021.107448&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ress_2021_107448
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0951-8320&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0951-8320&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0951-8320&client=summon