Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints

The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some...

Full description

Saved in:
Bibliographic Details
Published in2008 Fourth International Conference on Natural Computation Vol. 4; pp. 202 - 206
Main Authors Bao, Z.W., Cui, L.R., Wei Gao
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
Automotive engineering
block-chain precedence constraints
Cost function
Inspection
k-out-of-n system
optimal sequencing
Paper technology
Programmable logic arrays
sequential testing
System testing
Technology management
Vehicles
Online AccessGet full text
ISBN9780769533049
0769533043
ISSN2157-9555
DOI10.1109/ICNC.2008.270

Cover

More Information
Summary:The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some inspection cost, the true state of the system can be obtained by sequentially inspecting its components. Our aim is to find the optimal inspection strategies that can minimize the expected inspection cost of complex systems which are subject to block-chain precedence constraints, such as series, parallel or -out-of- system, and the optimal inspection rules of the more complex systems can be obtained by these simple systems.
ISBN:9780769533049
0769533043
ISSN:2157-9555
DOI:10.1109/ICNC.2008.270