arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.12976cs.MA
收藏

用于模型检测连续时间多智能体系统的实用抽象

Practical Abstractions for Model Checking Continuous-Time Multi-Agent Systems

Yan Kim, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci

AI总结:

本文扩展基于变量抽象的模型归约方法,提出面向实时多智能体系统的 MAS 图与抽象过程,证明其对 TCTL 全称片段的正确性,并通过爱沙尼亚投票系统模型和 Uppaal 验证其实用效果。

摘要:

时序逻辑的模型检测是一种用于验证和确认多智能体系统(MAS)性质的成熟技术。然而,实用的模型检测需要规模可控的输入模型。本文将 Jamroga 和 Kim 近期提出的基于变量抽象的模型归约方法扩展到实时系统与性质的验证。为此,我们定义了 MAS 图的实时扩展,扩展了抽象过程,并证明了其对 Timed Computation Tree Logic(TCTL,时间计算树逻辑)全称片段的正确性。除评估理论复杂度收益外,我们还针对爱沙尼亚投票系统的简化模型给出了实验评估,并使用 Uppaal 模型检测器进行验证。

英文摘要:

Model checking of temporal logics in a well established technique to verify and validate properties of multi-agent systems (MAS). However, practical model checking requires input models of manageable size. In this paper, we extend the model reduction method by variable-based abstraction, proposed recently by Jamroga and Kim, to the verification of real-time systems and properties. To this end, we define a real-time extension of MAS graphs, extend the abstraction procedure, and prove its correctness for the universal fragment of Timed Computation Tree Logic (TCTL). Besides estimating the theoretical complexity gains, we present an experimental evaluation for a simplified model of the Estonian voting system and verification using the Uppaal model checker.

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

↑