A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram

A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram

Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Quality and reliability engineering international 2024-07, Vol.40 (5), p.2904-2914
Hauptverfasser: Huang, Tudi, Zeng, Ying, Li, Yan‐Feng, Liu, Jun, Huang, Hong‐Zhong
Format: Artikel
Sprache:eng
Schlagworte:
basic events ordering method
Boolean logical operation rules
Complex systems
Complexity
Dynamic characteristics
dynamic fault tree
Fault trees
sequential binary decision diagram
System reliability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2914
container_issue 5
container_start_page 2904
container_title Quality and reliability engineering international
container_volume 40
creator Huang, Tudi
Zeng, Ying
Li, Yan‐Feng
Liu, Jun
Huang, Hong‐Zhong
description Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.
doi_str_mv 10.1002/qre.3555
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3076987056</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3076987056</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2935-3df82dd1b83518b24b1f45d34924100477832a6e65537a28453fcb01df4d11fb3</originalsourceid><addsrcrecordid>eNp10MtKAzEUBuAgCtYq-AgBN26m5jqTWZZSL1AQRdchmSQ1ZWbSJjOWvr2pdevqQPhOzs8PwC1GM4wQedhFO6Oc8zMwwaiuC1xScQ4mqGKiEAhXl-AqpQ1CGddiAvQc9nYPQzQ2-n4NOzt8BQODg1ol30D7bfshQd9Dc-hVl1-cGtsBDtFa6EKEye7GTLxqofa9igdobOOTD3nDq3VU3TW4cKpN9uZvTsHn4_Jj8VysXp9eFvNV0ZCa8oIaJ4gxWAvKsdCEaewYN5TVhOWwrKoEJaq0Jee0UkQwTl2jETaOGYydplNwd_p3G0POlAa5CWPs80lJUVXWokK8zOr-pJoYUorWyW30Xc4tMZLHBmVuUB4bzLQ40b1v7eFfJ9_el7_-BylbcWY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3076987056</pqid></control><display><type>article</type><title>A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Huang, Tudi ; Zeng, Ying ; Li, Yan‐Feng ; Liu, Jun ; Huang, Hong‐Zhong</creator><creatorcontrib>Huang, Tudi ; Zeng, Ying ; Li, Yan‐Feng ; Liu, Jun ; Huang, Hong‐Zhong</creatorcontrib><description>Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.</description><identifier>ISSN: 0748-8017</identifier><identifier>EISSN: 1099-1638</identifier><identifier>DOI: 10.1002/qre.3555</identifier><language>eng</language><publisher>Bognor Regis: Wiley Subscription Services, Inc</publisher><subject>basic events ordering method ; Boolean logical operation rules ; Complex systems ; Complexity ; Dynamic characteristics ; dynamic fault tree ; Fault trees ; sequential binary decision diagram ; System reliability</subject><ispartof>Quality and reliability engineering international, 2024-07, Vol.40 (5), p.2904-2914</ispartof><rights>2024 John Wiley &amp; Sons Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2935-3df82dd1b83518b24b1f45d34924100477832a6e65537a28453fcb01df4d11fb3</citedby><cites>FETCH-LOGICAL-c2935-3df82dd1b83518b24b1f45d34924100477832a6e65537a28453fcb01df4d11fb3</cites><orcidid>0000-0003-4478-8349 ; 0000-0002-9121-1465</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fqre.3555$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fqre.3555$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Huang, Tudi</creatorcontrib><creatorcontrib>Zeng, Ying</creatorcontrib><creatorcontrib>Li, Yan‐Feng</creatorcontrib><creatorcontrib>Liu, Jun</creatorcontrib><creatorcontrib>Huang, Hong‐Zhong</creatorcontrib><title>A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram</title><title>Quality and reliability engineering international</title><description>Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.</description><subject>basic events ordering method</subject><subject>Boolean logical operation rules</subject><subject>Complex systems</subject><subject>Complexity</subject><subject>Dynamic characteristics</subject><subject>dynamic fault tree</subject><subject>Fault trees</subject><subject>sequential binary decision diagram</subject><subject>System reliability</subject><issn>0748-8017</issn><issn>1099-1638</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp10MtKAzEUBuAgCtYq-AgBN26m5jqTWZZSL1AQRdchmSQ1ZWbSJjOWvr2pdevqQPhOzs8PwC1GM4wQedhFO6Oc8zMwwaiuC1xScQ4mqGKiEAhXl-AqpQ1CGddiAvQc9nYPQzQ2-n4NOzt8BQODg1ol30D7bfshQd9Dc-hVl1-cGtsBDtFa6EKEye7GTLxqofa9igdobOOTD3nDq3VU3TW4cKpN9uZvTsHn4_Jj8VysXp9eFvNV0ZCa8oIaJ4gxWAvKsdCEaewYN5TVhOWwrKoEJaq0Jee0UkQwTl2jETaOGYydplNwd_p3G0POlAa5CWPs80lJUVXWokK8zOr-pJoYUorWyW30Xc4tMZLHBmVuUB4bzLQ40b1v7eFfJ9_el7_-BylbcWY</recordid><startdate>202407</startdate><enddate>202407</enddate><creator>Huang, Tudi</creator><creator>Zeng, Ying</creator><creator>Li, Yan‐Feng</creator><creator>Liu, Jun</creator><creator>Huang, Hong‐Zhong</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><orcidid>https://orcid.org/0000-0003-4478-8349</orcidid><orcidid>https://orcid.org/0000-0002-9121-1465</orcidid></search><sort><creationdate>202407</creationdate><title>A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram</title><author>Huang, Tudi ; Zeng, Ying ; Li, Yan‐Feng ; Liu, Jun ; Huang, Hong‐Zhong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2935-3df82dd1b83518b24b1f45d34924100477832a6e65537a28453fcb01df4d11fb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>basic events ordering method</topic><topic>Boolean logical operation rules</topic><topic>Complex systems</topic><topic>Complexity</topic><topic>Dynamic characteristics</topic><topic>dynamic fault tree</topic><topic>Fault trees</topic><topic>sequential binary decision diagram</topic><topic>System reliability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huang, Tudi</creatorcontrib><creatorcontrib>Zeng, Ying</creatorcontrib><creatorcontrib>Li, Yan‐Feng</creatorcontrib><creatorcontrib>Liu, Jun</creatorcontrib><creatorcontrib>Huang, Hong‐Zhong</creatorcontrib><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><jtitle>Quality and reliability engineering international</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huang, Tudi</au><au>Zeng, Ying</au><au>Li, Yan‐Feng</au><au>Liu, Jun</au><au>Huang, Hong‐Zhong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram</atitle><jtitle>Quality and reliability engineering international</jtitle><date>2024-07</date><risdate>2024</risdate><volume>40</volume><issue>5</issue><spage>2904</spage><epage>2914</epage><pages>2904-2914</pages><issn>0748-8017</issn><eissn>1099-1638</eissn><abstract>Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.</abstract><cop>Bognor Regis</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/qre.3555</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0003-4478-8349</orcidid><orcidid>https://orcid.org/0000-0002-9121-1465</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0748-8017
ispartof Quality and reliability engineering international, 2024-07, Vol.40 (5), p.2904-2914
issn 0748-8017
1099-1638
language eng
recordid cdi_proquest_journals_3076987056
source Wiley Online Library Journals Frontfile Complete
subjects basic events ordering method
Boolean logical operation rules
Complex systems
Complexity
Dynamic characteristics
dynamic fault tree
Fault trees
sequential binary decision diagram
System reliability
title A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-20T08%3A39%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20new%20ordering%20method%20of%20basic%20events%20in%20dynamic%20fault%20tree%20for%20sequential%20binary%20decision%20diagram&rft.jtitle=Quality%20and%20reliability%20engineering%20international&rft.au=Huang,%20Tudi&rft.date=2024-07&rft.volume=40&rft.issue=5&rft.spage=2904&rft.epage=2914&rft.pages=2904-2914&rft.issn=0748-8017&rft.eissn=1099-1638&rft_id=info:doi/10.1002/qre.3555&rft_dat=%3Cproquest_cross%3E3076987056%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3076987056&rft_id=info:pmid/&rfr_iscdi=true