On the determination of all tie sets and minimal cut sets between any two nodes of a graph through Petri nets
- 1 January 1983
- journal article
- Published by Elsevier in Microelectronics Reliability
- Vol. 23 (3) , 471-475
- https://doi.org/10.1016/0026-2714(83)91174-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Enumeration of all simple paths in a directed graph using Petri net: A systematic approachMicroelectronics Reliability, 1983
- A petri net approach to enumerate all system success paths for reliability evaluation of a complex systemMicroelectronics Reliability, 1982
- Enumeration of All Minimal Cut-Sets for a Node Pair in a GraphIEEE Transactions on Reliability, 1979
- State equation, controllability, and maximal matchings of petri netsIEEE Transactions on Automatic Control, 1977
- Determination of Tie Sets and Cut Sets for a System Without FeedbackIEEE Transactions on Reliability, 1977
- Computer Program for Approximating the Reliability Characteristics of Acyclic Directed GraphsIEEE Transactions on Reliability, 1977
- Cut-set graph and systematic generation of separating setsIEEE Transactions on Circuit Theory, 1972