arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.2449eess.SYcs.SY
收藏

稀缺故障系统的快速恢复

Rapid Recovery for Systems with Scarce Faults

National Taiwan University(国立台湾大学);Bar Ilan University(巴伊兰大学);University of Liverpool(利物浦大学);CITI, Academia Sinica(中央研究院资讯科学研究所)

Chung-Hao Huang, Doron Peled, Sven Schewe, Farn Wang

AI总结:

针对安全关键系统中故障稀少的情况,提出k-弹性控制目标,通过快速恢复少量故障实现高容错,并证明其低计算复杂度和可行性。

摘要:

我们的目标是通过控制安全关键系统实现高容错性。这归结为解决一个博弈:恶意环境注入故障,而控制器试图建立正确行为。我们为此类系统提出一种新的控制目标,在复杂性和精度之间取得更好的平衡:寻求具有k-弹性的系统。为了具有k-弹性,系统需要能够无限多次地从最多k个局部故障中快速恢复,前提是每块最多k个故障之间由没有故障发生的短恢复期隔开。k-弹性是对局部故障精确分布的一种简单但强大的抽象,但比传统的最大化局部故障数量的目标精细得多。我们论证了为什么我们认为这是安全关键系统在局部故障稀少且分散情况下的正确抽象层次。我们展示了关于弹性构建最优控制的计算复杂度较低,并通过实现和实验结果证明了可行性。

英文摘要:

Our goal is to achieve a high degree of fault tolerance through the control of a safety critical systems. This reduces to solving a game between a malicious environment that injects failures and a controller who tries to establish a correct behavior. We suggest a new control objective for such systems that offers a better balance between complexity and precision: we seek systems that are k-resilient. In order to be k-resilient, a system needs to be able to rapidly recover from a small number, up to k, of local faults infinitely many times, provided that blocks of up to k faults are separated by short recovery periods in which no fault occurs. k-resilience is a simple but powerful abstraction from the precise distribution of local faults, but much more refined than the traditional objective to maximize the number of local faults. We argue why we believe this to be the right level of abstraction for safety critical systems when local faults are few and far between. We show that the computational complexity of constructing optimal control with respect to resilience is low and demonstrate the feasibility through an implementation and experimental results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑