IEEE Transactions on Circuit Theory · 1973 · 210 citations · 11 references
Circuit ComplexityEngineeringBoolean FunctionNetwork RobustnessNetwork AnalysisComputational ComplexitySystem ReliabilityFormal VerificationReliability EngineeringCombinatorial OptimizationBoolean SumComputer EngineeringComputer ScienceTerminal ReliabilityGraph AlgorithmCommunication NetworkApproximate ComputationFault-tolerant NetworkNetwork ScienceGraph TheoryNetwork AlgorithmSurvivable NetworkFormal MethodsBoolean Algebra MethodMulti-terminal Information Theory
Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by transforming a Boolean sum of products into an equivalent form in which all terms are disjoint. This new approach seems to be promising in respect to existing 4[ 6 methods both for the exact and for the approximate computation of the terminal reliability.
11
Introduction to the Theory of Switching Circuits
K.W. Cattermole · Electronics and Power · 1966 · 262 citations
Analysis of Switching Networks
C. Y. Lee · Bell System Technical Journal · 1955 · 229 citations
Network reliability analysis: Part I
Richard Van Slyke, H. Frank · Networks · 1971 · 139 citations
Engineering, Combinatorial Analysis, Equal Reliabilities +16