paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking

多面体模型检测中的弱单纯形互模拟与最小化
LMCS vol.Volume 22, Issue 12026匹配度 1/10 · 该论文属于形式化方法与空间模型检测,研究多面体模型上的弱互模拟与最小化,虽涉及程序验证,但未涉及 LLM/Agent、静态分析、浮点程序分析或贝叶斯程序分析等用户核心方向。引用 5 inbox
Nick Bezhanishvili, Laura Bussi, Vincenzo Ciancia, David Gabelaia, Mamuka Jibladze, Diego Latella, Mieke Massink, Erik P. de Vink
crossref: 2026-09-10

AI 速览

一句话:提出多面体模型上的弱单纯形互模拟与胞腔偏序模型上的弱±互模拟,并给出基于LTS编码和mCRL2的最小化方法。

该文研究多面体模型及其离散胞腔偏序模型上的空间逻辑 SLCSη 的模型检测。作者证明多面体到胞腔偏序模型的映射保持并反映 SLCSη,并定义多面体上的弱单纯形互模拟与胞腔偏序模型上的弱 ± 互模拟;弱等价比 SLCS 对应等价更粗,可显著缩小模型。论文证明二者具有 Hennessy-Milner 性质:互模拟等价当且仅当逻辑等价。还提出最小化过程,通过编码为 LTS 并利用 mCRL2 的分支互模拟最小化功能,正确计算弱 ± 互模拟意义下的最小模型;示例验证其有效性。

问题
多面体模型(如网格处理)的空间模型检测因模型规模大而代价高;需要合适的离散表示与更粗的行为等价来缩减状态。
方法
定义弱单纯形互模拟与弱 ± 互模拟,证明其 Hennessy-Milner 性质,并将胞腔偏序模型编码为 LTS,借助 mCRL2 的分支互模拟进行最小化。
评估
通过证明映射保持/反映 SLCSη、最小化正确性,并给出多个示例展示缩减与效率。
原文摘要(Abstract)

The work described in this paper builds on the polyhedral semantics of the Spatial Logic for Closure Spaces (SLCS) and the geometric spatial model checker PolyLogicA. Polyhedral models are central in domains that exploit mesh processing, such as 3D computer graphics. A discrete representation of polyhedral models is given by cell poset models, which are amenable to geometric spatial model checking on polyhedral models using the logical language SLCS$η$, a weaker version of SLCS. In this work we show that the mapping from polyhedral models to cell poset models preserves and reflects SLCS$η$. We also propose weak simplicial bisimilarity on polyhedral models and weak $\pm$-bisimilarity on cell poset models, where by ``weak'' we mean that the relevant equivalence is coarser than the corresponding one for SLCS, leading to a greater reduction of the size of models and thus to more efficient model checking. We show that the proposed bisimilarities enjoy the Hennessy-Milner property, i.e. two points are weakly simplicial bisimilar iff they are logically equivalent for SLCS$η$. Similarly, two cells are weakly $\pm$-bisimilar iff they are logically equivalent in the poset-model interpretation of SLCS$η$. Furthermore we present a model minimisation procedure and prove that it correctly computes the minimal model with respect to weak $\pm$-bisimilarity, i.e. with respect to logical equivalence of SLCS$η$. The procedure works via an encoding into LTSs and then exploits branching bisimilarity on those LTSs, exploiting the minimisation capabilities as included in the mCRL2 toolset. Various examples show the effectiveness of the approach.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@article{abs-2411-11428,
  title = {Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking},
  author = {Nick Bezhanishvili and Laura Bussi and Vincenzo Ciancia and David Gabelaia and Mamuka Jibladze and Diego Latella and Mieke Massink and Erik P. de Vink},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 1},
  year = {2026},
  doi = {10.46298/lmcs-22(1:6)2026}
}