A method for constructing non-basic GL-models by combining models with arbitrary graph structures

Main Article Content

Vitaliy A. Romankevich
Kostiantyn V. Morozov
Alexei M. Romankevich
Daniil V. Halytsky
Lefteris Zacharioudakis

Abstract

The paper proposes a method for constructing GL-models of failure behavior for a special class of non-basic fault-tolerant multiprocessor systems. The considered class includes systems whose failure behavior is determined by the fulfillment of one of several conditions that depend on combinations of processor states and are specified by the corresponding Boolean expressions. When any of these conditions is satisfied, the system failure behavior can be described by an individual auxiliary model constructed using known methods. The objective of this study is to develop a generalized method for constructing models of such non-basic systems by combining multiple auxiliary models of arbitrary types into a single model that correctly represents the system failure behavior. The proposed method is based on modifying the edge functions of the auxiliary models using the Boolean expressions of the corresponding conditions, after which the modified models are combined by merging arbitrarily selected vertices of their graphs. It is shown that the resulting model reproduces the behavior of the corresponding auxiliary model under each condition and thus correctly describes the failure behavior of the original system. The scientific novelty of this work lies in the proposed approach to combining auxiliary models of a general form, which imposes no constraints on the structure of their graphs and, unlike existing approaches, does not require these models to be based on cycle graphs. This makes it possible to construct models for a wide class of non-basic fault-tolerant multiprocessor systems with complex operability conditions. A comparative analysis of the complexity of edge-function expressions in models constructed using the proposed method and those obtained by existing approaches is carried out on a set of representative examples, revealing a significant reduction in the complexity of such expressions. The case of parallel evaluation of edge-function values is considered separately, and a reduction in the maximum expression complexity is demonstrated, which is important for decreasing computation time. The practical significance of the work lies in the applicability of the proposed method to constructing models of complex non-basic fault-tolerant multiprocessor systems, as well as in reducing the complexity of analyzing their failure behavior. The presented examples and experimental results confirm the correctness of the constructed models and demonstrate the possibility of further simplification by eliminating edges with identically unit edge functions. The proposed approach can be used in the analysis and design of critical control systems, as well as in automated reliability assessment of non-basic fault-tolerant multiprocessor systems with a large number of components.

Downloads

Download data is not yet available.

Article Details

Topics

Section

Theoretical aspects of computer science, programming and data analysis

Authors

Author Biographies

Vitaliy A. Romankevich, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, 37, Peremogy Ave. Kyiv, 03056, Ukraine

Doctor of Engineering Sciences, Professor, Head of System Programming and Specialized Computer System Department

Scopus Author ID: 57193263058

Kostiantyn V. Morozov, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, 37, Peremogy Ave. Kyiv, 03056, Ukraine

PhD, Assistant, System Programming and Specialized Computer System Department

Scopus Author ID: 57222509251

Alexei M. Romankevich, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, 37, Peremogy Ave. Kyiv, 03056, Ukraine

Doctor of Engineering Sciences, Professor, System Programming and Specialized Computer System Department

Scopus Author ID: 6602114176

Daniil V. Halytsky, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, 37, Peremogy Ave. Kyiv, 03056, Ukraine

postgraduate student, System Programming and Specialized Computer System Department

Scopus Author ID: 58553487600

Lefteris Zacharioudakis, Neapolis University Pafos, 2, Danais Ave., Pafos, 8042, Cyprus

PhD (Eng), Assistant professor

Scopus Author ID: 57422876200

Most read articles by the same author(s)

Similar Articles

You may also start an advanced similarity search for this article.