2000 character limit reached
Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT
Published 5 May 2020 in cs.AI, cs.CR, cs.DM, cs.LO, cs.NI, cs.SY, and eess.SY | (2005.03003v1)
Abstract: In this paper, we present a novel MaxSAT-based technique to compute Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We model the MPMCS problem as a Weighted Partial MaxSAT problem and solve it using a parallel SAT-solving architecture. The results obtained with our open source tool indicate that the approach is effective and efficient.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
