A New GO Methodology Algorithm Based on BDD

2013 ◽  
Vol 791-793 ◽  
pp. 1134-1138
Author(s):  
Jian Fan ◽  
Yi Ren ◽  
Lin Lin Liu
Keyword(s):  
System Reliability ◽  
Binary Decision Diagram ◽  
Analysis Procedure ◽  
Logic Tree ◽  
Minimal Path ◽  
Binary Decision ◽  
Go Model ◽  
Go Methodology ◽  
Minimal Path Sets

To solve the problems on quick achieving reliability and the minimal path sets (MPS) of a system with GO Methodology, a Binary Decision Diagram (BDD) based new GO methodology algorithm is introduced. This technique can avoid the shared signals and combination explosion problems simultaneously. Detailed steps with a case study are presented to explain the analysis procedure of this technique, firstly, establish the GO model and transform it into a directed acyclic diagram (DAG), logic tree and BDD successively; then minimize the BDD according to the Without Rule; at last, this system reliability and MPS can be achieved. The results of the studied case verify the validity and effectiveness of this algorithm.

Computational Complexity of Coherent Systems and the Reliability Polynomial

1988 ◽  
Vol 2 (4) ◽  
pp. 461-469 ◽  
Author(s):  
R.E. Barlow ◽  
S. Iyer
Keyword(s):  
System Reliability ◽  
Graph Representation ◽  
Coherent System ◽  
Coherent Systems ◽  
Logic Tree ◽  
Network Graph ◽  
Minimal Path ◽  
Reliability Polynomial ◽  
First Finding ◽  
Pivoting Strategies

There are three general methods for system reliability evaluation, namely; (1) inclusion–exclusion, (2) sum of disjoint products, and (3) pivoting. Of these, only pivoting can be applied directly to a logic tree or network graph representation without first finding minimal path (or cut) sets. Domination theory provides the basis for selecting optimal pivoting strategies. Simple proofs of domination-theory results for coherent systems are given, based on the reliability polynomial. These results are related to the problem of finding efficient strategies for computing coherent system reliability. The original results for undirected networks are due to Satyanarayana and Chang [5] (cf. [1]). Many of the original set theoretic results are due to Huseby [3]. However, he does not use the reliability polynomial to prove his results.

Application of GO methodology in reliability analysis of aircraft flap hydraulic system

2019 ◽  
Vol 124 (1272) ◽  
pp. 257-270 ◽  
Author(s):  
J. Ma ◽  
F. Duan
Keyword(s):  
Complex Systems ◽  
Reliability Analysis ◽  
System Reliability ◽  
Hydraulic System ◽  
Feedback Loop ◽  
Fault Tree Analysis ◽  
Safety Evaluation ◽  
Go Model ◽  
Go Methodology ◽  
Civil Aircraft

ABSTRACTThe Goal-Oriented methodology (GO methodology) is an effective method for the reliability analysis of complex systems. It is especially suitable for the reliability analysis of multi-state complex systems containing the actual logistics, such as current, airflow and liquid flow. In order to solve the limitation that the GO methodology is not suitable for the reliability analysis of the system with feedback loop, the Boolean algebra idea is introduced to construct the Boolean operation formula of the feedback loop. In this paper, a certain type of civil aircraft flap hydraulic system with feedback loop is taken as the research object. According to the structural schematic diagram of the flap hydraulic system, the GO model of the flap hydraulic system is established. Next, the GO calculation is carried out to obtain the reliability of the flap hydraulic system. The comparison between the system reliability without feedback loop and that with feedback loop proves that the GO methodology with feedback loop is more accurate. The reliability of the system is analyzed by using the fault tree analysis (FTA) method, and the GO methodology with feedback loop is compared with the FTA method to verify the availability and correctness of the GO methodology in the reliability analysis and safety evaluation of aircraft flap hydraulic system.

AN EFFICIENT MULTI-VARIABLE INVERSION ALGORITHM FOR RELIABILITY EVALUATION OF COMPLEX SYSTEMS USING PATH SETS

2002 ◽  
Vol 09 (03) ◽  
pp. 237-259 ◽  
Author(s):  
S. K. CHATURVEDI ◽  
K. B. MISRA
Keyword(s):  
Complex Systems ◽  
System Reliability ◽  
Computing System ◽  
Reliability Evaluation ◽  
Compact Form ◽  
Connection Matrix ◽  
Inversion Algorithm ◽  
Minimal Path ◽  
Matrix Operations ◽  
Minimal Path Sets

Reliability evaluation of a large and complex system is quite an involved and time-consuming process and its state-of-art is far from being called as satisfactory. This is mainly due to the fact that unionizing path sets results in large number of terms in the reliability expression. Thereafter, the process of computing numerical value of system reliability from its expression is a task not free from the build up of round-off errors. The entire process also restricts the use of a low-end PC for computing system reliability of such systems. In this paper, we propose an efficient methodology to evaluate reliability of large and complex systems based on minimal path sets; the path sets enumeration procedure used in this paper generates path sets in lexicographic and increasing order of cardinality — a condition, which is helpful in obtaining sum of disjoint products (SDP) of the system reliability expression in a compact form. Although we make use of the system connection matrix but no complicated matrix operations are performed to obtain the results. The paper further presents an improved multi-variable inversion (MVI) algorithm to evaluate system reliability in a compact form. Our approach offers an extensive reduction in the number of mutually disjoint terms and provides a minimized and compact system reliability expression. The procedure not only results in substantial saving of CPU time but also can be run on a low-end PC. To demonstrate this capability, we solve several problems of varied complexities on a low-end PC and also provide a comparison of our approach with earlier techniques available for the purpose.

A Binary Decision Diagram Based Cascade Prognostics Scheme For Power Systems

2020 ◽  
Author(s):  
Ajay Chhokra ◽  
Saqib Hasan ◽  
Abhishek Dubey ◽  
Gabor Karsai
Keyword(s):  
Power Systems ◽  
Binary Decision Diagram ◽  
Binary Decision

Method based on directed graph and binary decision diagram to break logic loops

Kerntechnik ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. 488-499
Author(s):  
S. Yuan ◽  
M. Huifang
Keyword(s):  
Directed Graph ◽  
Binary Decision Diagram ◽  
Binary Decision

A Dynamic Service Pool Size Configuration Mechanism for Service-Oriented Workflow

2011 ◽  
Vol 186 ◽  
pp. 499-504 ◽  
Author(s):  
Pan He ◽  
Jie Xu ◽  
Kai Gui Wu ◽  
Jun Hao Wen
Keyword(s):  
System Reliability ◽  
Environmental Changes ◽  
Point Of View ◽  
Pool Size ◽  
Reliability Model ◽  
Optimal Method ◽  
Service Oriented ◽  
Overall Reliability

Service-oriented workflows are the fundamental structures in service-oriented applications and changes in the workflow could cause dramatic changes in system reliability. In several ways to re-heal workflows in execution, re-sizing service pools in the workflow is practical and easy to implement. In order to quickly adjust to workflow or environmental changes, this paper presents a dynamic service pool size configuration mechanism from the point of view of maintaining workflow reliability. An architecture-based reliability model is used to evaluate the overall reliability of a workflow with service pools and an optimal method is proposed to get the combination of service pool size aiming at minimizing the sum of service pool size subject to the workflow reliability requirement. A case study is used to explain this method and experiment results show how to change service pool size to meet the workflow reliability requirements.

Sign in / Sign up

Export Citation Format

Share Document