Fault tree analysis considering sequence dependence and repairable input events
Purpose - This paper aims to present two methods for calculating the steady state probability of a repairable fault tree with priority AND gates and repeated basic events when the minimal cut sets are given.Design methodology approach - The authors consider a situation that the occurrence of an oper...
Gespeichert in:
Veröffentlicht in: | Journal of quality in maintenance engineering 2013-01, Vol.19 (2), p.199-214 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 214 |
---|---|
container_issue | 2 |
container_start_page | 199 |
container_title | Journal of quality in maintenance engineering |
container_volume | 19 |
creator | Yuge, Tetsushi Ozeki, Shinya Yanagi, Shigeru |
description | Purpose - This paper aims to present two methods for calculating the steady state probability of a repairable fault tree with priority AND gates and repeated basic events when the minimal cut sets are given.Design methodology approach - The authors consider a situation that the occurrence of an operational demand and its disappearance occur alternately. We assume that both the occurrence and the restoration of the basic event are statistically independent and exponentially distributed. Here, restoration means the disappearance of the occurring event as a result of a restoration action. First, we obtain the steady state probability of an output event of a single-priority AND gate by Markov analysis. Then, we propose two methods of obtaining the top event probability based on an Inclusion-Exclusion method and by considering the sum of disjoint probabilities.Findings - The closed form expression of steady state probability of a priority AND gate is derived. The proposed methods for obtaining the top event probability are compared numerically with conventional Markov analysis and Monte Carlo simulation to verify the effectiveness. The result shows the effectiveness of the authors' methods.Originality value - The methodology presented shows a new solution for calculating the top event probability of repairable dynamic fault trees. |
doi_str_mv | 10.1108/13552511311315986 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1559646222</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2989065461</sourcerecordid><originalsourceid>FETCH-LOGICAL-c384t-7fd2dc2b6d968bd8d96f16dc54a6dca61e92497760a3a1208cfb85cb8e2f701a3</originalsourceid><addsrcrecordid>eNp1kEtLw0AQxxdRsFY_gLcFLx6M7iP7yFGKVaHQi57DZnciKekm7iZCv70bKwiVwjAzML__vBC6puSeUqIfKBeCCUr5ZKLQ8gTNqBI6U5qz05SnejYB5-gixg0hhBeKzNB6acZ2wEMAwMabdhebiG3nY-MgNP4DR_gcwVvADnrw7ic13uEAvWmCqVrAje_HAcMX-CFeorPatBGufuMcvS-f3hYv2Wr9_Lp4XGWW63zIVO2Ys6ySrpC6cjqFmkpnRW6SN5JCwfJCKUkMN5QRbetKC1tpYLUi1PA5ut337UOXFoxDuW2ihbY1HroxllSIQuaSMZbQmwN0040h3ZooLgUttM5VouiesqGLMUBd9qHZmrArKSmnF5f_Xpw0d3sNbCGY1v1JDtGyd3XCyRH86IRv_cOJ9Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1365198847</pqid></control><display><type>article</type><title>Fault tree analysis considering sequence dependence and repairable input events</title><source>Standard: Emerald eJournal Premier Collection</source><source>Emerald A-Z Current Journals</source><creator>Yuge, Tetsushi ; Ozeki, Shinya ; Yanagi, Shigeru</creator><creatorcontrib>Yuge, Tetsushi ; Ozeki, Shinya ; Yanagi, Shigeru</creatorcontrib><description>Purpose - This paper aims to present two methods for calculating the steady state probability of a repairable fault tree with priority AND gates and repeated basic events when the minimal cut sets are given.Design methodology approach - The authors consider a situation that the occurrence of an operational demand and its disappearance occur alternately. We assume that both the occurrence and the restoration of the basic event are statistically independent and exponentially distributed. Here, restoration means the disappearance of the occurring event as a result of a restoration action. First, we obtain the steady state probability of an output event of a single-priority AND gate by Markov analysis. Then, we propose two methods of obtaining the top event probability based on an Inclusion-Exclusion method and by considering the sum of disjoint probabilities.Findings - The closed form expression of steady state probability of a priority AND gate is derived. The proposed methods for obtaining the top event probability are compared numerically with conventional Markov analysis and Monte Carlo simulation to verify the effectiveness. The result shows the effectiveness of the authors' methods.Originality value - The methodology presented shows a new solution for calculating the top event probability of repairable dynamic fault trees.</description><identifier>ISSN: 1355-2511</identifier><identifier>EISSN: 1758-7832</identifier><identifier>DOI: 10.1108/13552511311315986</identifier><identifier>CODEN: JQMEFI</identifier><language>eng</language><publisher>Bradford: Emerald Group Publishing Limited</publisher><subject>Algorithms ; Cold ; Computer simulation ; Dependence ; Failure ; Fault trees ; Gates ; Markov analysis ; Markov processes ; Mathematical analysis ; Mathematical models ; Monte Carlo simulation ; Probability ; Repair & maintenance ; Restoration ; Risk assessment ; Steady state ; Studies</subject><ispartof>Journal of quality in maintenance engineering, 2013-01, Vol.19 (2), p.199-214</ispartof><rights>Emerald Group Publishing Limited</rights><rights>Copyright Emerald Group Publishing Limited 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c384t-7fd2dc2b6d968bd8d96f16dc54a6dca61e92497760a3a1208cfb85cb8e2f701a3</citedby><cites>FETCH-LOGICAL-c384t-7fd2dc2b6d968bd8d96f16dc54a6dca61e92497760a3a1208cfb85cb8e2f701a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/13552511311315986/full/pdf$$EPDF$$P50$$Gemerald$$H</linktopdf><linktohtml>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/13552511311315986/full/html$$EHTML$$P50$$Gemerald$$H</linktohtml><link.rule.ids>314,776,780,961,11614,21674,27901,27902,52661,52664,53219,53347</link.rule.ids></links><search><creatorcontrib>Yuge, Tetsushi</creatorcontrib><creatorcontrib>Ozeki, Shinya</creatorcontrib><creatorcontrib>Yanagi, Shigeru</creatorcontrib><title>Fault tree analysis considering sequence dependence and repairable input events</title><title>Journal of quality in maintenance engineering</title><description>Purpose - This paper aims to present two methods for calculating the steady state probability of a repairable fault tree with priority AND gates and repeated basic events when the minimal cut sets are given.Design methodology approach - The authors consider a situation that the occurrence of an operational demand and its disappearance occur alternately. We assume that both the occurrence and the restoration of the basic event are statistically independent and exponentially distributed. Here, restoration means the disappearance of the occurring event as a result of a restoration action. First, we obtain the steady state probability of an output event of a single-priority AND gate by Markov analysis. Then, we propose two methods of obtaining the top event probability based on an Inclusion-Exclusion method and by considering the sum of disjoint probabilities.Findings - The closed form expression of steady state probability of a priority AND gate is derived. The proposed methods for obtaining the top event probability are compared numerically with conventional Markov analysis and Monte Carlo simulation to verify the effectiveness. The result shows the effectiveness of the authors' methods.Originality value - The methodology presented shows a new solution for calculating the top event probability of repairable dynamic fault trees.</description><subject>Algorithms</subject><subject>Cold</subject><subject>Computer simulation</subject><subject>Dependence</subject><subject>Failure</subject><subject>Fault trees</subject><subject>Gates</subject><subject>Markov analysis</subject><subject>Markov processes</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Monte Carlo simulation</subject><subject>Probability</subject><subject>Repair & maintenance</subject><subject>Restoration</subject><subject>Risk assessment</subject><subject>Steady state</subject><subject>Studies</subject><issn>1355-2511</issn><issn>1758-7832</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kEtLw0AQxxdRsFY_gLcFLx6M7iP7yFGKVaHQi57DZnciKekm7iZCv70bKwiVwjAzML__vBC6puSeUqIfKBeCCUr5ZKLQ8gTNqBI6U5qz05SnejYB5-gixg0hhBeKzNB6acZ2wEMAwMabdhebiG3nY-MgNP4DR_gcwVvADnrw7ic13uEAvWmCqVrAje_HAcMX-CFeorPatBGufuMcvS-f3hYv2Wr9_Lp4XGWW63zIVO2Ys6ySrpC6cjqFmkpnRW6SN5JCwfJCKUkMN5QRbetKC1tpYLUi1PA5ut337UOXFoxDuW2ihbY1HroxllSIQuaSMZbQmwN0040h3ZooLgUttM5VouiesqGLMUBd9qHZmrArKSmnF5f_Xpw0d3sNbCGY1v1JDtGyd3XCyRH86IRv_cOJ9Q</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Yuge, Tetsushi</creator><creator>Ozeki, Shinya</creator><creator>Yanagi, Shigeru</creator><general>Emerald Group Publishing Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>K6~</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M2P</scope><scope>M7S</scope><scope>PQBIZ</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>S0W</scope></search><sort><creationdate>20130101</creationdate><title>Fault tree analysis considering sequence dependence and repairable input events</title><author>Yuge, Tetsushi ; Ozeki, Shinya ; Yanagi, Shigeru</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c384t-7fd2dc2b6d968bd8d96f16dc54a6dca61e92497760a3a1208cfb85cb8e2f701a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Cold</topic><topic>Computer simulation</topic><topic>Dependence</topic><topic>Failure</topic><topic>Fault trees</topic><topic>Gates</topic><topic>Markov analysis</topic><topic>Markov processes</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Monte Carlo simulation</topic><topic>Probability</topic><topic>Repair & maintenance</topic><topic>Restoration</topic><topic>Risk assessment</topic><topic>Steady state</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yuge, Tetsushi</creatorcontrib><creatorcontrib>Ozeki, Shinya</creatorcontrib><creatorcontrib>Yanagi, Shigeru</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>ProQuest One Business</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering & Technology Collection</collection><jtitle>Journal of quality in maintenance engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yuge, Tetsushi</au><au>Ozeki, Shinya</au><au>Yanagi, Shigeru</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fault tree analysis considering sequence dependence and repairable input events</atitle><jtitle>Journal of quality in maintenance engineering</jtitle><date>2013-01-01</date><risdate>2013</risdate><volume>19</volume><issue>2</issue><spage>199</spage><epage>214</epage><pages>199-214</pages><issn>1355-2511</issn><eissn>1758-7832</eissn><coden>JQMEFI</coden><abstract>Purpose - This paper aims to present two methods for calculating the steady state probability of a repairable fault tree with priority AND gates and repeated basic events when the minimal cut sets are given.Design methodology approach - The authors consider a situation that the occurrence of an operational demand and its disappearance occur alternately. We assume that both the occurrence and the restoration of the basic event are statistically independent and exponentially distributed. Here, restoration means the disappearance of the occurring event as a result of a restoration action. First, we obtain the steady state probability of an output event of a single-priority AND gate by Markov analysis. Then, we propose two methods of obtaining the top event probability based on an Inclusion-Exclusion method and by considering the sum of disjoint probabilities.Findings - The closed form expression of steady state probability of a priority AND gate is derived. The proposed methods for obtaining the top event probability are compared numerically with conventional Markov analysis and Monte Carlo simulation to verify the effectiveness. The result shows the effectiveness of the authors' methods.Originality value - The methodology presented shows a new solution for calculating the top event probability of repairable dynamic fault trees.</abstract><cop>Bradford</cop><pub>Emerald Group Publishing Limited</pub><doi>10.1108/13552511311315986</doi><tpages>16</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1355-2511 |
ispartof | Journal of quality in maintenance engineering, 2013-01, Vol.19 (2), p.199-214 |
issn | 1355-2511 1758-7832 |
language | eng |
recordid | cdi_proquest_miscellaneous_1559646222 |
source | Standard: Emerald eJournal Premier Collection; Emerald A-Z Current Journals |
subjects | Algorithms Cold Computer simulation Dependence Failure Fault trees Gates Markov analysis Markov processes Mathematical analysis Mathematical models Monte Carlo simulation Probability Repair & maintenance Restoration Risk assessment Steady state Studies |
title | Fault tree analysis considering sequence dependence and repairable input events |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T01%3A58%3A35IST&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=Fault%20tree%20analysis%20considering%20sequence%20dependence%20and%20repairable%20input%20events&rft.jtitle=Journal%20of%20quality%20in%20maintenance%20engineering&rft.au=Yuge,%20Tetsushi&rft.date=2013-01-01&rft.volume=19&rft.issue=2&rft.spage=199&rft.epage=214&rft.pages=199-214&rft.issn=1355-2511&rft.eissn=1758-7832&rft.coden=JQMEFI&rft_id=info:doi/10.1108/13552511311315986&rft_dat=%3Cproquest_cross%3E2989065461%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=1365198847&rft_id=info:pmid/&rfr_iscdi=true |