A new algorithm for generating minimal cut sets in k-out-of-n networks

Evaluating the network reliability is an important topic in the planning, designing, and control of systems. A k-out-of-n network is a special network in that some nodes must receive at least k (>1) flows from all of their input edges (n). In real-life cases, many networks such as computer and telecommunications include k-out-of-n nodes for redundancy. The minimal-cut-node-set (MCN) is the major and fundamental tools for evaluating the k-out-of-n network reliability. In this study, a very simple algorithm based on some intuitive theorems that characterize the structure of the MCN is developed to solve the k-out-of-n network reliability. Compared to the existing algorithms, the proposed algorithm generates all k-out-of-n MCs without duplication based on fewer MCNs and fewer (k-out-of-n MC) candidates. The proposed algorithm is not only easier to understand and implement, but is also better than the existing algorithms. The correctness of the proposed algorithm will be analyzed and proven. One example is illustrated to show how all k-out-of-n MCs are generated, verified, and implemented to evaluate the k-out-of-n network reliability using the proposed algorithm.     

A simple algorithm for evaluating the k-out-of-n network reliability

Evaluating the network reliability is an important topic in the planning, designing, and control of systems. The minimal cut set (MC, an edge set) is one of the major and fundamental tools for evaluating network reliability. A k-out-of-n MC is a special MC in a k-out-of-n network in which some nodes must receive at least k flows from their n input edges, where k is an integer number between 1 and n. In this study, an alternative method is given first to define a MC using a node set (called MCN) in k-out-of-n networks. A very simple algorithm based on some intuitive theorems that characterize the structure of the MCN and the relationship between MC and MCN is developed to solve the k-out-of-n network reliability by finding the k-out-of-n MCs between two special nodes. The proposed algorithm is not only easier to understand and implement, but is also better than the existing algorithm. The correctness of the proposed algorithm will be analyzed and proven. Two examples are illustrated to show how all k-out-of-n MCs are generated and verified in a k-out-of-n network using the proposed algorithm. The reliability of one example is then computing using one example.     

New insights into the assessment of k-out-of-n and related systems

k-out-of-n and related systems have received much attention in the recent past years. Hundreds of articles were devoted to various methods to assess them. In this article, we show that there exist very efficient algorithms to compute the reliability of k-out-of-n, l-to-h-out-of-n and consecutive k-out-of-n systems. k-within-r-out-of-n systems are intrinsically much harder. We study the performance of binary decision diagrams (BDDs) on these systems. Then, we propose a new approximation scheme. This algorithm is much more efficient in practice than already proposed methods.     

Exact equation and an algorithm for reliability evaluation of K-out-of-N:G system

An expression for reliability of K-out-of-N:G system is proposed. An algorithm for computing reliability of K-out-of-N system is given. It is an easy to implement, fast and memory efficient algorithm and helps to improve the computational efficiency considerably.     

A path-based algorithm for evaluating the k-out-of-n flow network reliability

Evaluating the network reliability is an important topic in the planning, designing and control of systems. The minimal path (MP, an edge set) set is one of the major, fundamental tools for evaluating network reliability. A k-out-of-n MP is a union of some MPs in a k-out-of-n flow network in which some nodes must receive flows from their k input distinctive edges (each input edge has one flow) to generate one flow, where k is an integer number between 2 and n. In this study, a very simple a-lgorithm based on some intuitive theorems that characterize the k-out-of-n MP structure and the relationship between k-out-of-n MPs and k-out-of-n MP candidates is developed to solve the k-out-of-n flow network reliability by finding the k-out-of-n MPs between two special nodes. The proposed algorithm is easier to understand and implement. The correctness of the proposed algorithm will be analyzed and proven. One example is illustrated to show how all k-out-of-n MPs are generated and verified in a k-out-of-n flow network using the proposed algorithm. The reliability of one example is then computing using the same example.     

Minimal cut sets of s–t networks with k-out-of-n nodes

In this paper, we extend traditional directed s–t network by letting nodes have k-out-of-n property: To generate output flows, a node must receive at least k flows from its n input links, where k is an integer assigned for the node and its value can be any number from 1 to n. To evaluate the system reliability, minimal cut sets for the extended network are defined for nodes. Under this definition, an extended network and its sink node have the same minimal cut sets. A new algorithm is designed to generate minimal cut sets for all nodes, starting with the source node and ending with the sink node. With different initializations, the algorithm can be applied for extended s–t networks with or without node failures.     

Composition dependence of binary diffusion coefficients in alkane mixtures

The binary diffusion coefficients of mixtures of n-heptane with n-hexane and 2,2,4-trimethylpentane with n-hexane have been measured at various compositions at 308.1, 312.2, and 316.5 K using the Taylor dispersion technique. The experimental results for the n-hexane/n-heptane system were in good agreement with the literature values (<1.5%). The observed binary diffusion coefficients for this system exhibit a linear dependence on composition. On the contrary, the results of the n-hexane/2,2,4-trimethylpentane system reveal an interesting behavior of the composition dependence of the binary diffusion coefficients, presenting a slight maximum, for composition at a molar fraction of n-hexane of 0.86. In order to explain this difference in behavior, the influence of branching of molecules on diffusion is discussed. It was found that although the Enskog hard-sphere model for binary diffusion can reproduce the experimental results for the n-hexane/n-heptane system within 3%, it failed to predict the composition dependence of the n-hexane/2,2,4-trimethylpentane system within the experimental accuracy. The results showed that there is significant effect of branching in alkane molecules on the diffusion coefficient. This effect has been quantified using the roughness parameter, which represents the magnitude of coupling between translational and rotational motions.     

Weibull and inverse Weibull mixture models allowing negative weights

This article presents the finding that when components of a system follow the Weibull or inverse Weibull distribution with a common shape parameter, then the system can be represented by a Weibull or inverse Weibull mixture model allowing negative weights. We also use an example to illustrate that the proposed mixture model can be used to approximate the reliability behaviours of the consecutive-k-out-of-n systems. The example also shows data analysis procedures when the parameters of the component life distributions are either known or unknown.     

The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method

In this article, a special node called the k⁻-out-of-n node, which cannot receive more than a certain amount of flows, is newly introduced. The acyclic multistate-node network (AMNN) that unsatisfied the flow conservation law is then extended to the k-out-of-n AMNN by including the k⁻-out-of-n and k⁺-out-of-n nodes. A very simple universal generating function method (UGFM) based on some intuitive properties that characterize the structure of the k-out-of-n AMNN is developed to solve the k-out-of-n AMNN reliability. The correctness of the proposed UGFM will be analyzed and proven. An example with three special cases illustrates how the k-out-of-n AMNN reliability is evaluated using the proposed UGFM. To show that the proposed UGFM can also solve the AMNN reliability, the first case of the example demonstrates that the proposed UGFM without needing to remove redundant terms and collecting like terms is more efficient and reasonable than the best-known UGFM.     

Assessment of redundant systems with imperfect coverage by means of binary decision diagrams

In this article, we study the assessment of the reliability of redundant systems with imperfect fault coverage. We term fault coverage as the ability of a system to isolate and correctly accommodate failures of redundant elements. For highly reliable systems, such as avionic and space systems, fault coverage is in general imperfect and has a significant impact on system reliability. We review here the different models of imperfect fault coverage. We propose efficient algorithms to assess them separately (as k-out-of-n selectors). We show how to implement these algorithms into a binary decision diagrams engine. Finally, we report experimental results on real life test cases that show on the one hand the importance of imperfect coverage and on the other hand the efficiency of the proposed approach.     

Optimal design of multi-state weighted k-out-of-n systems based on component design

This paper presents a study on design optimization of multi-state weighted k-out-of-n systems. The studied system reliability model is more general than the traditional k-out-of-n system model. The system and its components are capable of assuming a whole range of performance levels, varying from perfect functioning to complete failure. A utility value corresponding to each state is used to indicate the corresponding performance level. A widely studied reliability optimization problem is the “component selection problem”, which involves selection of components with known reliability and cost characteristics. Less adequately addressed has been the problem of determining system cost and utility based on the relationships between component reliability, cost and utility. This paper addresses this topic. All the optimization problems dealt with in this paper can be categorized as either minimizing the expected total system cost subject to system reliability requirements, or maximizing system reliability subject to total system cost limitation. The resulting optimization problems are too complicated to be solved by traditional optimization approaches; therefore, genetic algorithm (GA) is used to solve them. Our results show that GA is a powerful tool for solving these kinds of problems.     

Efficient reliability analysis of dynamic k-out-of-n phase-AND mission systems

Motivated by real-world applications of satellites and wireless sensor networks, this paper models and evaluates a dynamic k-out-of-n phase-AND mission system (k/n-PAMS). The mission task conducted by a k/n-PAMS involves multiple consecutive phases; the mission is successful as long as the task is successful in any of the phases. Due to factors, such as scheduled maintenance, location changes in task execution during different phases, and resource sharing with other tasks, the total number of available components n for the considered mission task and the required number of working components k may change from phase to phase. In addition, due to varying load and working environments, component failure time distributions are also phase dependent. This paper proposes an analytical modeling approach based on multivalued decision diagrams (MDDs) for assessing reliability of the considered k/n-PAMS. The approach encompasses a new and fast MDD model generation algorithm that considers behaviors of all the mission phases simultaneously based on node labeling. As demonstrated through empirical studies on k/n-PAMSs with different sizes (different numbers of phases and different numbers of system components), the proposed algorithm is more efficient than the traditional phase-by-phase model generation method.     

Exact reliability formula and bounds for general k-out-of-n systems

The paper deals with reliability of general k-out-of-n systems whose component failures need not be independent and identically distributed. The result is an exact closed form reliability formula which is based on Feller's result. The formula is efficient and easy to use for manual and computer computations. The approximations for the system reliability are given and are useful when dealing with large systems. Two examples illustrate the use of the results.     

The thermal conductivity of n-hexane,n-heptane,and n-decane by the transient hot-wire method

New absolute measurements of the thermal conductivity of liquid n-hexane, n-heptane, and n-decane are reported. The measurements have been carried out in the temperature range 300–370 K at atmospheric pressure in a transient hotwire instrument. The accuracy of the measurements is estimated to be ±0.5%. The density dependence of the thermal conductivity of n-hexane and n-heptane is found to be well described by a universal equation for the hydrocarbons based on a rough hard-sphere model. The measurements of the three hydrocarbons studied are also employed to generate more accurate effective core volumes, which are the only parameters characteristic of the fluid required for the application of the proposed universal scheme.     

Economic design of a circular consecutive--out-of-:F system with -step Markov dependence

A circular consecutive-k-out-of-n:F system consists of n components arranged along a circular path. The system fails if and only if at least k consecutive components in the system fail. The system reliability, the expected system life, and the expected number of failures are obtained under the assumption that the failure rate of a component depends on the number of consecutive failed components that follow it. A procedure to find the optimal k and a simulation procedure to search the near-optimal k are proposed with illustrative numerical examples. An expected cost per unit time is considered as the objective function to be minimized.     

Reliability evaluation of furnace systems

This article reports an application of the k-out-of-n:F and the consecutive-k-out-of-n:F system reliability models in evaluation of the life distribution of furnaces used in a petro-chemical company. Different scenarios are used in modeling the reliability behaviors of the furnaces as a function of the reliabilities of the tubes in the furnaces. The life distribution of the furnace is used in making decisions on when to replace the furnace.     

The viscosity of five liquid hydrocarbons at pressures up to 250 MPa

This paper reports new measurements of the viscosity of toluene, n-pentane, n-hexane, n-octane, and n-decane at pressures up to 250 MPa in the temperature range 303 to 348 K. The measurements were performed with a vibrating-wire viscometer and with a relative method of evaluation. Calibration of the instrument was carried out with respect to reference values of the viscosity of the same liquids at their saturation vapour pressure. The viscosity measurements have a precision of ±0.1% but the accuracy is limited by that of the calibration data to be ±0.5%. The experimental data have been represented by polynomial functions of pressure for the purposes of interpolation. The data are also used as the most precise test yet applied to a representation of the viscosity of liquids based upon hard-sphere theory.     

Equations of State for Technical Applications. II. Results for Nonpolar Fluids

New functional forms have been developed for multiparameter equations of state for non- and weakly polar fluids and for polar fluids. The resulting functional forms, which were established with an optimization algorithm which considers data sets for different fluids simultaneously, are suitable as a basis for equations of state for a broad variety of fluids. The functional forms were designed to fulfill typical demands of advanced technical applications with regard to the achieved accuracy. They are numerically very stable and their substance-specific coefficients can easily be fitted to restricted data sets. In this way, a fast extension of the group of fluids for which accurate empirical equations of state are available becomes possible. This article deals with the results found for the non- and weakly polar fluids methane, ethane, propane, isobutane, n-butane, n-pentane, n-hexane, n-heptane, n-octane, argon, oxygen, nitrogen, ethylene, cyclohexane, and sulfur hexafluoride. The substance-specific parameters of the new equations of state are given as well as statistical and graphical comparisons with experimental data. General features of the new class of equations of state such as their extrapolation behavior and their numerical stability have been discussed in a preceding article. Results for typical polar fluids will be discussed in a subsequent article.     

Measurements of the viscosity of n-heptane,n-nonane,and n-undecane at pressures up to 70 MPa

New absolute measurements of the viscosity of n-heptane, n-nonane, and n-undecane are presented. The measurements were performed with a vibrating-wire instrument at temperatures of 303.15 and 323.15 K and pressures up to 70 MPa. The overall uncertainty in the reported viscosity data is estimated to be ±0.5%. A recently developed semiempirical scheme for the correlation and prediction of the thermal conductivity, viscosity, and self-diffusion coefficients of n-alkanes is applied to the prediction of the viscosity of n-heptane, n-nonane, and n-undecane. The comparison of these predicted values with the present high-pressure measurements demonstrates the predictive power of this scheme.     

Reliability evaluation of multi-state weighted -out-of- systems

The k-out-of-n systems have been extensively studied in recent years. A binary weighted k-out-of-n model has also been reported in the literature. In this paper, we first compare two approaches for reliability evaluation of binary weighted k-out-of-n systems. We then provide two models of multi-state weighted k-out-of-n system models. Recursive algorithms are presented for reliability evaluation of these new models. The universal generating function approach is also used for reliability evaluation of multi-state weighted k-out-of-n systems.