A system-level analysis of robustness by randomised algorithms

Provides a methodology for analysing the robustness of a computational flow at a system level. Implementation issues, such as finite precision representation and fluctuations of the production parameters, can be studied directly at system level, independently from any technological aspect and quantisation technique. Only the behavioural descriptions of the computational flow and the architecture to be investigated are needed. The suggested analysis is based on the recently introduced theory of randomised algorithms, which transform the computationally intractable problem associated with the robustness investigation in a poly-time algorithm by resorting to probability