首次对含有不可靠节点的无圈序贯网络(Acyclic consecutively connected networks,ACCN)的可靠性进行分析.并首次提出n中取[k_1,k_2]节点的概念:当节点接收到的信号数量不小于k_1且不大于k_2时节点正常,否则失效.针对含有不可靠节点的.ACCN的性质对一般生成函数进行改进,建立节点的改进一般生成函数.随后根据改进一般生成函数的特点对递归过程进行简化.最后给出一个含有不完全可靠节点的网络的算例,利用改进一般生成函数和简化的递归过程对网络的可靠性进行评价,证明改进后的方法解决了含有不可靠节点的ACCN可靠性评价问题并有效的简化了计算过程.
Reliability evaluation for acyclic consecutively connected networks with unreliable node is first done in this paper.A special node called[k_1,k_2]out-of-n node,which can only receive not less than k_1 and not more than k_2 amount of signals,is newly introduced.First,establishes an improved universal generating function for acyclic consecutively connected networks with unreliable node,then a new recursive method based on the improved universal generating function is suggested.A numerical example is presented to demonstrate that the improved method is very effective for the acyclic consecutively connected networks with unreliable and simplify the compute process.