arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.21772eess.SYcs.SY
收藏

通过算法集成与HPC基础设施上的并行模拟扩展网络物理系统的统计模型检查

Scaling up statistical model checking of cyber-physical systems via algorithm ensemble and parallel simulations over HPC infrastructures

Sapienza University of Rome(罗马第一大学);Universite Catholique de Louvain(天主教鲁汶大学)

Leonardo Picchiami, Maxime Parmentier, Axel Legay, Toni Mancini, Enrico Tronci

AI总结:

该研究针对工业级CPS的SMC验证计算成本高的问题,提出结合AA与EBGStop的算法集成方法,结合HPC并行模拟,大幅减少样本量并实现线性加速,将验证时间从数月/年缩短至数小时/天。

摘要:

面向工业级网络物理系统(CPS)的基于模型的形式化验证通常是计算上难以承受的任务。在大多数情况下,模型的复杂性排除了符号分析的任何可能性,使得数值模拟成为唯一可行的选择。遗憾的是,在整个合理操作场景集合上对CPS模型进行穷举模拟在实践中很少可行,因此必须采用统计模型检查(SMC)等替代策略。本文表明,通过同时考虑多个(集成的)自适应停止算法(SAs),可显著减少SMC技术收敛所需的模型模拟次数(样本量);而模拟本身(整个工作负载中迄今为止最昂贵的步骤)可通过利用大规模并行平台有效加速。我们使用三个工业级CPS模型进行实验,结果显示,与运行单一算法相比,使用两个最先进的SAs(AA和EBGStop)的集成可减少数千万个样本,样本量减少幅度高达78%。此外,我们的实现通过在HPC基础设施上大规模并行化系统模型模拟,使验证任务的完成时间实现了与计算节点数几乎线性的加速,从而在非常大的平台上也能达到几乎100%的效率。这使得复杂CPS的基于模型的SMC验证任务可在数小时或数天内完成,而单纯的顺序执行则需要数月至数年。

英文摘要:

Model-based formal verification of industry-relevant Cyber-Physical Systems (CPSs) is often a computationally prohibitive task. In most cases, the complexity of the models precludes any prospect of symbolic analysis, leaving numerical simulation as the only viable option. Unfortunately, exhaustive simulation of a CPS model over the entire set of plausible operational scenarios is rarely possible in practice, and alternative strategies such as Statistical Model Checking (SMC) must be used instead. In this article, we show that the number of model simulations (samples) required by SMC techniques to converge can be significantly reduced by considering multiple (an ensemble of) Adaptive Stopping Algorithms (SAs) at once, and that the simulations themselves (by far the most expensive step of the entire workload) can be efficiently sped up by exploiting massively parallel platforms. With three industry-scale CPS models, we experimentally show that the use of an ensemble of two state-of-the-art SAs (AA and EBGStop) may require dozens of millions fewer samples when compared to running a single algorithm, with reductions in sample size of up to 78%. Furthermore, we show that our implementation, by massively parallelizing system model simulations on a HPC infrastructure, yields speed-ups for the completion time of the verification tasks which are practically linear with respect to the number of computational nodes, thus achieving an efficiency of virtually 100%, even on very large platforms. This makes it possible to complete tasks of model-based SMC verification for complex CPSs in a matter of hours or days, whereas a naïve sequential execution would require from months to many years.

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

↑