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

用于混合系统反驳的布尔连结词多臂老虎机(扩展版)

Multi-Armed Bandits for Boolean Connectives in Hybrid System Falsification (Extended Version)

National Institute of Informatics(国立情报学研究所);SOKENDAI (The Graduate University for Advanced Studies)(综合研究大学院大学)

Zhenya Zhang, Ichiro Hasuo, Paolo Arcaini

AI总结:

本文针对混合系统反驳中布尔连结词的尺度问题,提出一种结合多臂老虎机算法的改进方法,通过引入新的奖励概念'爬升收益'来提升鲁棒性,并在实验中证明其优于现有工具。

摘要:

混合系统反驳是实时物理系统可扩展质量保证方法的活跃研究领域。在反驳过程中,人们使用随机爬升优化快速找到黑盒系统模型的反例输入。定量鲁棒语义是使这种优化可行的技术关键。本文解决了一个在社区中广泛认可的所谓'尺度问题':不同量级的量(如速度[km/h] vs. RPM,或更糟糕的RPH)可能互相掩盖对鲁棒性的贡献。我们的解决方案是将多臂老虎机算法整合到爬升引导的反驳框架中,其技术新颖性在于引入了新的奖励概念,我们称之为'爬升收益'。我们的实验表明,该方法在尺度变化下的鲁棒性,并证明其优于最先进的反驳工具。

英文摘要:

Hybrid system falsification is an actively studied topic, as a scalable quality assurance methodology for real-world cyber-physical systems. In falsification, one employs stochastic hill-climbing optimization to quickly find a counterexample input to a black-box system model. Quantitative robust semantics is the technical key that enables use of such optimization. In this paper, we tackle the so-called scale problem regarding Boolean connectives that is widely recognized in the community: quantities of different scales (such as speed [km/h] vs. RPM, or worse, RPH) can mask each other's contribution to robustness. Our solution consists of integration of the multi-armed bandit algorithms in hill climbing-guided falsification frameworks, with a technical novelty of a new reward notion that we call hill-climbing gain. Our experiments show our approach's robustness under the change of scales, and that it outperforms a state-of-the-art falsification tool.

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

↑