paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A Spatial Logic for Simplicial Models

面向单纯形模型的空间逻辑
LMCS vol.Volume 19, Issue 32023匹配度 2/10 · 论文属于形式化方法与程序验证中的空间逻辑与模型检测,但与用户关注的 LLM/Agent 与静态分析、浮点程序分析、贝叶斯程序分析等交叉方向没有直接关联。仅在“程序验证/形式化验证”这一宽泛大类上略有交集,因此匹配度较低。引用 6 inbox
Michele Loreti, Michela Quadrini
crossref: 2026-09-10

AI 速览

一句话:提出在单纯复形上解释的空间逻辑,给出线性复杂度的模型检测算法,并用双模拟刻画其表达力。

集体自适应系统常由大量异构组件按组交互,其空间可由物理或逻辑关系决定。现有工作多将空间建模为图,只能刻画实体两两邻近,难以表达组与组等多实体关系。本文提出一种在单纯复形上解释的空间逻辑,利用可高效表示曲面与体积、并推广图的高阶边结构来建模空间。作者给出正确且完备的模型检测算法,其复杂度关于单纯复形维度和逻辑公式规模呈线性。并通过在单纯复形上定义空间版本的(分支)双模拟,研究该逻辑的表达能力。

问题
集体自适应系统中的空间性质常以图建模,但图只能表达实体两两邻近,无法刻画组与组等涉及多个实体的空间关系。
方法
提出在单纯复形上解释的空间逻辑,并设计正确且完备的模型检测算法;通过定义单纯复形上的空间(分支)双模拟分析逻辑表达力。
评估
理论评估表明,模型检测算法关于单纯复形维度和逻辑公式规模呈线性;逻辑表达力由空间双模拟与分支双模拟关系刻画。
原文摘要(Abstract)

Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the distribution of these entities determines a space that can be either physical or logical. The former is defined in terms of a physical relation among components. The latter depends on logical relations, such as being part of the same group. In this context, specification and verification of spatial properties play a fundamental role in supporting the design of systems and predicting their behaviour. For this reason, different tools and techniques have been proposed to specify and verify the properties of space, mainly described as graphs. Therefore, the approaches generally use model spatial relations to describe a form of proximity among pairs of entities. Unfortunately, these graph-based models do not permit considering relations among more than two entities that may arise when one is interested in describing aspects of space by involving interactions among groups of entities. In this work, we propose a spatial logic interpreted on simplicial complexes. These are topological objects, able to represent surfaces and volumes efficiently that generalise graphs with higher-order edges. We discuss how the satisfaction of logical formulas can be verified by a correct and complete model checking algorithm, which is linear to the dimension of the simplicial complex and logical formula. The expressiveness of the proposed logic is studied in terms of the spatial variants of classical bisimulation and branching bisimulation relations defined over simplicial complexes.

链接与引用

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

BibTeX
@article{paperbot2202,
  title = {A Spatial Logic for Simplicial Models},
  author = {Michele Loreti and Michela Quadrini},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 19, Issue 3},
  year = {2023},
  doi = {10.46298/lmcs-19(3:8)2023}
}