DeepAI AI Chat
Log In Sign Up

Optimising the reliability that can be claimed for a software-based system based on failure-free tests of its components

01/30/2022
by   Peter Bishop, et al.
0

This short paper describes a numerical method for optimising the conservative confidence bound on the reliability of a system based on tests of its individual components. This is an alternative to the algorithmic approaches identified in Bishop and Povyakalo (RESS 2020). For a given maximum number of component tests, the numerical method can derive an optimal test plan for any arbitrary system structure. The optimisation method is based on linear programming which is more efficient that the alternative integer programming. In addition, the optimisation process need only be performed once for any given system structure as the solution can be re-used to compute an optimal integer test plan for a different maximum number of component tests. This approach might have broader application to other optimisation problems that are normally implemented using integer programming methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/25/2023

A Sequential Deep Learning Algorithm for Sampled Mixed-integer Optimisation Problems

Mixed-integer optimisation problems can be computationally challenging. ...
04/22/2022

Lossy compression of matrices by black-box optimisation of mixed-integer non-linear programming

In edge computing, suppressing data size is a challenge for machine lear...
03/07/2019

Optimisation and Comprehensive Evaluation of Alternative Energising Paths for Power System Restoration

Power system restoration after a major blackout is a complex process, in...
09/19/2022

Trolley optimisation: An extension of bin packing to load PCB components

A trolley is a container for loading printed circuit board (PCB) compone...
05/30/2023

Majority Voting Approach to Ransomware Detection

Crypto-ransomware remains a significant threat to governments and compan...
07/18/2019

Finding First and Most-Beautiful Queens by Integer Programming

The n-queens puzzle is a well-known combinatorial problem that requires ...