On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Information Processing Letters
On limit reliability functions of large multi-state systems with ageing components
Applied Mathematics and Computation
A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components
IEEE Transactions on Computers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science
Investigation Multi-State System Reliability by Structure Function
DEPCOS-RELCOMEX '07 Proceedings of the 2nd International Conference on Dependability of Computer Systems
Exploiting interleaving semantics in symbolic state-space generation
Formal Methods in System Design
A New Decision-Diagram-Based Method for Efficient Analysis on Multistate Systems
IEEE Transactions on Dependable and Secure Computing
| Hi-index | 0.00 |
Network reliability analysis is usually carried out under the simplified hypothesis that the elements of the network are binary entities that can be in one of two mutually exclusive states, perfect functioning or failed. The present paper enlarges this view from two points of view. The elements of the networks are described by multiple states that can represent a variety of different situations, like degradation levels or multiple failure modes. Furthermore, in order to increase the description power of the model, we assign to each state a weight describing a performance attribute of the element in that state. The weights may assume different physical meanings so that different Quality of Service (QoS) indicators may be evaluated. We show that the QoS analysis of a multistate weighted probabilistic network can be performed by resorting to data structures called Multi-valued Decision Diagrams. Several examples illustrate the methodology.