2024/11/18 by Bezhanishvili, Nick, Bussi, Laura, Ciancia, Vincenzo +5 · 1 citation
#68N30 Mathematical aspects of software engineering (specification #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #etc.) #metrics #requirements #verification
paper · doi:10.48550/arxiv.2411.11428
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 ±-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 ±-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 ±-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.