On read-once Boolean functions
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Reliability of Computer and Communication Networks
Reliability of Computer and Communication Networks
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Network reliability evaluation is important for the planning, design and control of arbitrary systems. A novel set theory based method for deriving terminal reliability expressions of complex system configurations is described in this paper. The reliability formula of a networked system is expressed as sum of disjoint products, where the product terms represent conjunctions of Boolean variables and are all mutually exclusive. We approach the problem of deriving minimized sum of disjoint products given a complex system topology from a logic synthesis perspective, and show how our proposed method fares well in comparison with the results generated using a widely preferred two-level logic minimizer for some benchmarks.