arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.09324cs.LOcs.FL
收藏

基于交互的分布式系统离线可观测性验证

Dealing with observability in interaction-based Offline Runtime Verification of Distributed Systems

Erwan Mahe, Boutheina Bannour, Christophe Gaston, Arnault Lapitre, Pascale Le Gall

摘要:

交互是描述分布式系统(DS)中异步通信的形式化模型。它们可以以序列图的方式绘制,并通过类似于进程代数的操作语义执行。DS的执行可以通过称为多轨迹的本地轨迹元组(每个子系统一个)来表征。对于给定的执行,可以通过监视来收集这些本地跟踪,并且可以使用离线跟踪验证(RV)来分析所得到的多跟踪。为此,互动可以作为正式的参考。然而,在实践中,并非所有子系统都可以被观察到,并且在不对不同子系统上的监测的结束进行同步的情况下,可能无法观察到一些事件,例如,可以观察到消息的接收,但不能观察到对应的发射。为了能够考虑所有这些情况下的部分观察,我们提出了一个离线RV算法,使用删除操作来限制参考相互作用的飞行,忽略的部分不再观察到的子系统。我们证明了算法的正确性,并评估执行的性能。

英文摘要:

Interactions are formal models describing asynchronous communications within a Distributed System (DS). They can be drawn in the fashion of sequence diagrams and executed thanks to an operational semantics akin to that of process algebras. Executions of DS can be characterized by tuples of local traces (one per subsystem) called multi-traces. For a given execution, those local traces can be collected via monitoring and the resulting multi-trace can be analysed using offline Runtime Verification (RV). To that end, interactions may serve as formal references. In practice, however, not all subsystems may be observed and, without synchronising the end of monitoring on different subsystems, some events may not be observed, e.g. the reception of a message may be observed but not the corresponding emission. So as to be able to consider all such cases of partial observation, we propose an offline RV algorithm which uses removal operations to restrict the reference interaction on-the-fly, disregarding the parts concerning no longer observed subsystems. We prove the correctness of the algorithm and assess the performance of an implementation.

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

↑