Minimal cut sets of a coherent fault tree generation using reverse Petri nets

DOI10.1080/02331934.2013.796471zbMath1278.90118OpenAlexW1986488828MaRDI QIDQ2868919

Nebojsa Nikolic, Mirko Vujošević, Dragana Makajić-Nikolić

Publication date: 19 December 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.796471

zbMATH Keywords

minimal cut setfault treereverse Petri net

Mathematics Subject Classification ID

Trees (05C05) Reliability, availability, maintenance, inspection in operations research (90B25) Fault detection; testing in circuits and networks (94C12)

Related Items (2)

Determining the Set of the Most Critical System Components—Optimization Approach ⋮ Interdomain Quality of Service Negotiation Using DEA Analysis and Petri Nets

Uses Software

• MOCUS

Cites Work

• Unnamed Item
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• The use of Petri nets to analyze coherent fault trees
• FATRAM-A Core Efficient Cut-Set Algorithm
• Diagnosis of asynchronous discrete-event systems: a net unfolding approach

This page was built for publication: Minimal cut sets of a coherent fault tree generation using reverse Petri nets