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

何时素公式是特征公式?

When Are Prime Formulae Characteristic?

Luca Aceto, Dario Della Monica, Ignacio Fábregas, Anna Ingólfsdóttir

AI总结:

本文提出一般充分条件,保证模态逻辑中特征公式恰为一致且素公式,并证明该条件适用于多种行为关系,包括 van Glabbeek 谱系中的所有语义。

摘要:

在刻画模态转换系统上模态精化关系的模态逻辑背景下,Boudol 和 Larsen 证明了那些可将模型检测归约为预序检测的公式(即特征公式)恰好就是一致且素的公式。本文提出了保证特征公式恰好为一致且素公式的一般充分条件。文中证明了所给条件适用于文献中的多种行为关系。特别地,对于 van Glabbeek 的线性时间-分支时间谱系中的所有语义,特征公式恰好就是素且一致的公式。

英文摘要:

In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are exactly the consistent and prime ones. This paper presents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to various behavioural relations in the literature. In particular, characteristic formulae are exactly the prime and consistent ones for all the semantics in van Glabbeek's linear time-branching time spectrum.

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

↑