Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version

TL;DR

This paper introduces a weaker form of bisimilarity for polyhedral models and a corresponding logic, enabling more effective model reduction and logical equivalence detection in spatial model checking.

Contribution

It proposes a new weak bisimilarity notion for polyhedral models and a related logic, improving model reduction and logical equivalence analysis.

Findings

Weak bisimilarity leads to stronger model reductions.

Weak SLCS_eta logic characterizes bisimilarity and logical equivalence.

The approach is applicable to large, real-world polyhedral models.

Abstract

In the context of spatial logics and spatial model checking for polyhedral models -- mathematical basis for visualisations in continuous space -- we propose a weakening of simplicial bisimilarity. We additionally propose a corresponding weak notion of $\pm$-bisimilarity on cell-poset models, a discrete representation of polyhedral models. We show that two points are weakly simplicial bisimilar iff their repesentations are weakly $\pm$-bisimilar. The advantage of this weaker notion is that it leads to a stronger reduction of models than its counterpart that was introduced in our previous work. This is important, since real-world polyhedral models, such as those found in domains exploiting mesh processing, typically consist of large numbers of cells. We also propose SLCS_eta, a weaker version of the Spatial Logic for Closure Spaces (SLCS) on polyhedral models, and we show that the proposed bisimilarities enjoy the Hennessy-Milner property: two points are weakly simplicial bisimilar iff they are logically equivalent for SLCS_eta. Similarly, two cells are weakly $\pm$-bisimilar iff they are logically equivalent in the poset-model interpretation of SLCS_eta. This work is performed in the context of the geometric spatial model checker PolyLogicA and the polyhedral semantics of SLCS.