Reasoning About the Reliability of Multi-version, Diverse Real-Time Systems

TY - GEN

T1 - Reasoning About the Reliability of Multi-version, Diverse Real-Time Systems

AU - Burns, A.

AU - Littlewood, B.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - This paper is concerned with the development of reliable real-time systems for use in high integrity applications. It advocates the use of diverse replicated channels, but does not require the dependencies between the channels to be evaluated. Rather it develops and extends the approach of Little wood and Rush by (for general systems) by investigating a two channel system in which one channel, A, is produced to a high level of reliability (i.e. has a very low failure rate), while the other, B, employs various forms of static analysis to sustain an argument that it is perfect (i.e. it will never miss a deadline). The first channel is fully functional, the second contains a more restricted computational model and contains only the critical computations. Potential dependencies between the channels (and their verification) are evaluated in terms of aleatory and epistemic uncertainty. At the aleatory level the events ''A fails" and ''B is imperfect" are independent. Moreover, unlike the general case, independence at the epistemic level is also proposed for common forms of implementation and analysis for real-time systems and their temporal requirements (deadlines). As a result, a systematic approach is advocated that can be applied in a real engineering context to produce highly reliable real-time systems, and to support numerical claims about the level of reliability achieved.

AB - This paper is concerned with the development of reliable real-time systems for use in high integrity applications. It advocates the use of diverse replicated channels, but does not require the dependencies between the channels to be evaluated. Rather it develops and extends the approach of Little wood and Rush by (for general systems) by investigating a two channel system in which one channel, A, is produced to a high level of reliability (i.e. has a very low failure rate), while the other, B, employs various forms of static analysis to sustain an argument that it is perfect (i.e. it will never miss a deadline). The first channel is fully functional, the second contains a more restricted computational model and contains only the critical computations. Potential dependencies between the channels (and their verification) are evaluated in terms of aleatory and epistemic uncertainty. At the aleatory level the events ''A fails" and ''B is imperfect" are independent. Moreover, unlike the general case, independence at the epistemic level is also proposed for common forms of implementation and analysis for real-time systems and their temporal requirements (deadlines). As a result, a systematic approach is advocated that can be applied in a real engineering context to produce highly reliable real-time systems, and to support numerical claims about the level of reliability achieved.

UR - http://www.scopus.com/inward/record.url?scp=79951796002&partnerID=8YFLogxK

U2 - 10.1109/RTSS.2010.43

DO - 10.1109/RTSS.2010.43

M3 - Conference contribution

SN - 978-0-7695-4298-0

SP - 73

EP - 81

BT - 2010 IEEE 31st Real-Time Systems Symposium (RTSS)

PB - IEEE Computer Society

T2 - 2010 IEEE 31st Real-Time Systems Symposium (RTSS)

Y2 - 30 November 2010 through 3 December 2010

ER -