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

有限行为观察与验证的拓扑框架

A Topological Framework for Finite Behavioural Observations and Verification

Reykjavik University(雷克雅未克大学)

Antonis Achilleos, Vasiliki Kyriakou

AI总结:

本文通过拓扑学研究有限观察对过程空间的影响,提出一般性验证定理,并实例化得到多迹和模拟可监视性。

摘要:

形式验证和可监视性基于有限观察,这些观察允许从系统行为的有限信息中验证性质。我们通过它们在过程空间上生成的拓扑来研究这些观察。我们首先考虑基于迹的拓扑,并证明在 $\Sigma^\omega$ 上的有限迹观察诱导出 Cantor 拓扑,而完全迹包含对应的拓扑是离散的。然后我们转向任意过程空间,其中有限迹观察定义了拓扑 $\tau_O$,并证明模拟观察生成一个严格更细的拓扑 $\tau_{\mathrm{sim}}$。接下来,我们证明了一个一般性验证定理,表明对于任何由有限观察生成的拓扑,开集正是那些可由这些观察验证的性质。我们将此结果实例化到 $\tau_O$ 和 $\tau_{\mathrm{sim}}$,得到多迹和模拟可监视性作为具体案例。最后,我们考察了用更强关系替代模拟的效果,证明有限深度互模拟产生一个真正不同的拓扑。

英文摘要:

Formal verification and monitorability are based on finite observations, which allow properties to be verified from finite information about system behaviour. We study such observations through the topologies they generate on spaces of processes. We first consider trace-based topologies and show that finite trace observations on the space of infinite traces induce the Cantor topology, while the topology corresponding to full trace inclusion is the discrete topology. We then move to arbitrary process spaces, where finite trace observations define the observation topology, and show that simulation observations generate a strictly finer topology. Next, we prove a general verification theorem showing that, for any topology generated by finite observations, open sets are exactly the properties verifiable by those observations. We instantiate this result for the observation and simulation topologies, obtaining multi-trace and simulation monitorability as concrete cases. Finally, we examine the effect of replacing simulation with stronger relations, showing that finite-depth bisimulation induces a topology finer than the simulation topology.

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

↑