31. Direct Calculation: A Novel P-graph Based Method for Determining Reliability
Invited abstract in session WE-4: P-graph Algorithms, stream P-graph algorithms and applications.
Wednesday, 14:45 - 16:15Room: C105
Authors (first author is the speaker)
| 1. | Mihály István Sümegi
|
| University of Pannonia | |
| 2. | Ákos Orosz
|
| Department of Computer Science and Systems Technology, University of Pannonia |
Abstract
Reliability is a key indicator when designing complex industrial processes, consequently, methods for its determination have already been published in the middle of the last century. Most deterministic methods are based on recognising either specific structural patterns or smaller subsystems that guarantee operation or failure.
This paper explores a novel approach which begins at the starting points of a process and iteratively calculates internal reliabilities via propagation. As a result the method does not depend on preliminary identification of structural patterns but is still deterministic and provides an exact result.
The method is based on the P-graph framework, which is a combinatorial tool for process synthesis. The framework’s unambiguous representation of complex processes provides the basis for the correct propagation. Through the logical connections represented by the bipartite graph, the necessary operations at each step can be identified.
Several case studies have been examined to compare the proposed approach to previous ones. The determined reliability values match the results of previous algorithms even for the most complicated networks. As expected, the efficiency of the method highly depends on the structure of the process, however, the tests indicate that it can significantly surpass previous methods for a large number of cases.
Keywords
- Complexity and efficiency of optimization algorithms
Status: accepted
Back to the list of papers