STOCHASTIC BOUNDS FOR GENERALIZED SYSTEMS IN RELIABILITY THEORY
スポンサーリンク
概要
- 論文の詳細を見る
Practically, it is not feasible to obtain the precise reliability of systems in a reasonable time, when the systems are large and complex. In this paper, we present some stochastic bounds on generalized systems of which state spaces are mathematically partially ordered sets. In the first place we introduce a notion of generalized systems and then present some stochastic bounds on the system reliability by using maximal and minimal elements of the structures of the systems. The bounds are generalization of the well-known max-min bounds on binary-state system reliability. Furthermore, we present the other stochastic bounds when systems are decomposed into several modules and satisfy a condition which is called MC (Maximal Coincidence) condition. We show that these bounds are tighter than the former. For a few simple systems, we give numerical examples and estimations of computational complexity for obtaining these stochastic bounds.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Nishida Toshio
Osaka University
-
Nishida T
Osaka University
-
Ohi F
Aichi Institute Of Technology
-
Shinmori Shuichi
Department of Mathematical Sciences, Faculty of Engineering, Osaka University
-
Ohi Fumio
Aichi Institute of Technology
-
Shinmori Shuichi
Faculty Of Science Kagoshima University
関連論文
- A GENERALIZED VERSION OF ONE MACHINE MAXIMUM LATENESS PROBLEM
- STOCHASTIC BOUNDS FOR GENERALIZED SYSTEMS IN RELIABILITY THEORY
- ON AN EXTENSION OF BARLOW-WU SYSTEMS : BASIC PROPERTIES
- An Improved Algorithm to Compute Marginal Reliability Importance in a Network System(Reliability, Maintainability, and Safety Analysis)
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS
- A NEW ALGORITHM : FOR LOWER BOUNDS OF ALL-TERMINAL RELIABILITY
- The Evaluations on Lower Bounds of All-Terminal Reliability by Arc-Packings for General Networks (Special Section on Discrete Mathematics and Its Applications)