{"id":"https://openalex.org/W3049585699","doi":"https://doi.org/10.1109/tr.2020.3014012","title":"SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets","display_name":"SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets","publication_year":2020,"publication_date":"2020-08-14","ids":{"openalex":"https://openalex.org/W3049585699","doi":"https://doi.org/10.1109/tr.2020.3014012","mag":"3049585699"},"language":"en","primary_location":{"id":"doi:10.1109/tr.2020.3014012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2020.3014012","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051273658","display_name":"Weilin Luo","orcid":"https://orcid.org/0000-0002-3733-9361"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weilin Luo","raw_affiliation_strings":["School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-3733-9361","affiliations":[{"raw_affiliation_string":"School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101977871","display_name":"Ou Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ou Wei","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0001-6744-9994","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027600524","display_name":"Hai Wan","orcid":"https://orcid.org/0000-0001-5357-9130"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hai Wan","raw_affiliation_strings":["School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China"],"raw_orcid":"https://orcid.org/0000-0001-5357-9130","affiliations":[{"raw_affiliation_string":"School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8948,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7538692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"70","issue":"2","first_page":"575","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.726961612701416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6399927139282227},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.621658205986023},{"id":"https://openalex.org/keywords/fault-tree-analysis","display_name":"Fault tree analysis","score":0.4826710522174835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4739629924297333},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.430508553981781},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.430253267288208}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.726961612701416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6399927139282227},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.621658205986023},{"id":"https://openalex.org/C107094494","wikidata":"https://www.wikidata.org/wiki/Q428453","display_name":"Fault tree analysis","level":2,"score":0.4826710522174835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4739629924297333},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.430508553981781},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.430253267288208},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tr.2020.3014012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2020.3014012","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G263586505","display_name":null,"funder_award_id":"61573386","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5739924965","display_name":null,"funder_award_id":"61976232","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W149544036","https://openalex.org/W1491113077","https://openalex.org/W1518705996","https://openalex.org/W1523041988","https://openalex.org/W1584297074","https://openalex.org/W1589170163","https://openalex.org/W1592338211","https://openalex.org/W1785980509","https://openalex.org/W1787074469","https://openalex.org/W1820309519","https://openalex.org/W1968105169","https://openalex.org/W1977526558","https://openalex.org/W1983711511","https://openalex.org/W1986006371","https://openalex.org/W1994368477","https://openalex.org/W2000164931","https://openalex.org/W2003762784","https://openalex.org/W2032890961","https://openalex.org/W2036265926","https://openalex.org/W2039161303","https://openalex.org/W2043876870","https://openalex.org/W2044560939","https://openalex.org/W2083377950","https://openalex.org/W2089167558","https://openalex.org/W2097869978","https://openalex.org/W2098629662","https://openalex.org/W2100179054","https://openalex.org/W2110210775","https://openalex.org/W2113315940","https://openalex.org/W2118622620","https://openalex.org/W2121337044","https://openalex.org/W2130463697","https://openalex.org/W2137875903","https://openalex.org/W2140209083","https://openalex.org/W2144338184","https://openalex.org/W2153390672","https://openalex.org/W2156081053","https://openalex.org/W2158963168","https://openalex.org/W2163191232","https://openalex.org/W2171493679","https://openalex.org/W2201941870","https://openalex.org/W2212468806","https://openalex.org/W2296202685","https://openalex.org/W2498324117","https://openalex.org/W3123509436","https://openalex.org/W3149078839","https://openalex.org/W3165744266","https://openalex.org/W4206807714","https://openalex.org/W4231640108","https://openalex.org/W4249289606","https://openalex.org/W6629400801","https://openalex.org/W6632501209","https://openalex.org/W6676500147","https://openalex.org/W6677084137","https://openalex.org/W6688097215","https://openalex.org/W6697459422"],"related_works":["https://openalex.org/W2013926333","https://openalex.org/W2140425425","https://openalex.org/W1558180718","https://openalex.org/W1635223198","https://openalex.org/W2348129335","https://openalex.org/W1572445670","https://openalex.org/W4292463236","https://openalex.org/W2139907818","https://openalex.org/W1499470128","https://openalex.org/W4320165485"],"abstract_inverted_index":{"Fault":[0],"tree":[1],"analysis":[2,8],"(FTA)":[3],"is":[4,11,41,69,197,263],"a":[5,24,42,70,140,153,160,200,230,265],"prominent":[6],"reliability":[7],"method,":[9],"which":[10,175,215,239],"widely":[12],"used":[13],"in":[14,45,55,58,97,107,210,247,271,279,312],"safety-critical":[15],"industries.":[16],"Computing":[17,67],"the":[18,30,34,52,62,91,165,177,183,207,225,236,243,284],"minimal":[19],"cut":[20,161,184],"sets":[21],"(MCSs)":[22],"of":[23,33,64,82,94,224,307],"fault":[25,49,154,259],"tree,":[26,155],"i.e.,":[27],"finding":[28],"all":[29],"smallest":[31],"combinations":[32],"basic":[35],"events":[36],"that":[37],"cause":[38],"system":[39],"failures,":[40],"fundamental":[43],"step":[44],"FTA.":[46],"Since":[47],"coherent":[48],"trees":[50],"are":[51,61,100,212],"most":[53,313],"common":[54],"industrial":[56],"systems":[57],"practice,":[59,98],"they":[60],"focus":[63],"this":[65,125],"article.":[66],"MCSs":[68,96,145],"computationally":[71],"hard":[72],"problem.":[73],"Classical":[74],"methods":[75,113],"have":[76],"been":[77],"proposed":[78],"based":[79,146,163,181],"on":[80,103,131,147,164,182,257,295],"manipulation":[81],"Boolean":[83,133],"expressions":[84],"and":[85,105,206,221,278,287],"binary":[86],"decision":[87],"diagrams.":[88],"However,":[89],"given":[90,152],"inherent":[92],"intractability":[93],"computing":[95,144],"there":[99],"still":[101],"limitations":[102],"time":[104,272],"memory":[106,296,310],"these":[108,299],"methods.":[109],"Therefore,":[110],"developing":[111],"new":[112,141,195],"over":[114],"different":[115],"paradigms":[116],"remains":[117],"to":[118,217,234],"be":[119],"an":[120,192],"interesting":[121],"research":[122],"direction.":[123],"In":[124],"article,":[126],"motivated":[127],"by":[128],"recent":[129],"progress":[130],"modern":[132],"satisfiability":[134],"problem":[135],"(SAT)":[136],"solvers,":[137],"we":[138,156,186,228],"present":[139],"method":[142],"for":[143,159,190,203,241],"SAT,":[148],"namely":[149],"SATMCS.":[150],"Specifically,":[151,301],"iteratively":[157],"search":[158,219,245],"set":[162],"conflict-driven":[166],"clause":[167,202],"learning":[168],"framework.":[169],"By":[170],"exploiting":[171],"local":[172],"propagation":[173,180],"graph,":[174],"characterizes":[176],"partial":[178],"failure":[179],"set,":[185],"provide":[187],"efficient":[188],"algorithms":[189],"extracting":[191],"MCS.":[193],"The":[194],"MCS":[196],"learned":[198],"as":[199],"block":[201],"SAT":[204,248],"solving,":[205],"conflict":[208],"clauses":[209],"iterations":[211],"incrementally":[213],"recorded,":[214],"helps":[216],"prune":[218],"space":[220],"ensures":[222],"completeness":[223],"results.":[226],"Moreover,":[227],"adopt":[229],"jump-chronological":[231],"backtracking":[232],"strategy":[233],"prepare":[235],"next":[237],"iteration,":[238],"allows":[240],"reusing":[242],"same":[244],"steps":[246],"solving.":[249],"We":[250],"compare":[251],"SATMCS":[252,262,290,302],"with":[253,274],"state-of-the-art":[254],"commercial":[255],"tools":[256],"practical":[258],"trees.":[260],"Although":[261],"only":[264],"prototype,":[266],"it":[267,282],"shows":[268],"comparable":[269],"performance":[270,294],"consumption":[273],"one":[275,305],"tool":[276],"(XFTA),":[277],"various":[280],"cases,":[281],"outperforms":[283],"others":[285],"(FaultTree+":[286],"Commander).":[288],"Besides,":[289],"exhibits":[291],"much":[292],"better":[293],"usage":[297,311],"than":[298],"tools.":[300],"consumes":[303],"about":[304],"order":[306],"magnitude":[308],"less":[309],"instances.":[314]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}