Minimal cut sets of a coherent fault tree generation using reverse Petri nets
From MaRDI portal
Recommendations
- An algorithm for solving minimal cut set of causality diagram by Petri net model
- The use of Petri nets to analyze coherent fault trees
- A research on a fault tree minimal cut set generation algorithm based on binary decision diagram
- Algorithms for Generating Minimal Cutsets by Inversion
- A New Technique in Minimal Path and Cutset Evaluation
Cites work
- Diagnosis of asynchronous discrete-event systems: a net unfolding approach
- FATRAM-A Core Efficient Cut-Set Algorithm
- scientific article; zbMATH DE number 1049168 (Why is no real title available?)
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- The use of Petri nets to analyze coherent fault trees
Cited in
(5)- Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems
- Determining the set of the most critical system components -- optimization approach
- Interdomain quality of service negotiation using DEA analysis and Petri nets
- An algorithm for solving minimal cut set of causality diagram by Petri net model
- A research on a fault tree minimal cut set generation algorithm based on binary decision diagram
This page was built for publication: Minimal cut sets of a coherent fault tree generation using reverse Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868919)
