Vincenzo Ciancia ; Diego Latella ; Mieke Massink ; Erik P. de Vink - On Bisimilarity for Quasi-discrete Closure Spaces

lmcs:10873 - Logical Methods in Computer Science, August 26, 2025, Volume 21, Issue 3 - https://doi.org/10.46298/lmcs-21(3:21)2025
On Bisimilarity for Quasi-discrete Closure SpacesArticle

Authors: Vincenzo Ciancia ; Diego Latella ; Mieke Massink ; Erik P. de Vink

    Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and quasi-discrete closure spaces induces a notion of neighborhood akin to that of topological spaces that build on open sets. For closure models and quasi-discrete closure models, in this paper we present three notions of bisimilarity that are logically characterised by corresponding modal logics with spatial modalities: (i) CM-bisimilarity for closure models (CMs) is shown to generalise topo-bisimilarity for topological models and to be an instantiation of neighbourhood bisimilarity, when CMs are seen as (augmented) neighbourhood models. CM-bisimilarity corresponds to equivalence with respect to the infinitary modal logic IML that includes the modality ${\cal N}$ for ``being near to''. (ii) CMC-bisimilarity, with `CMC' standing for CM-bisimilarity with converse, refines CM-bisimilarity for quasi-discrete closure spaces, carriers of quasi-discrete closure models. Quasi-discrete closure models come equipped with two closure operators, Direct ${\cal C}$ and Converse ${\cal C}$, stemming from the binary relation underlying closure and its converse. CMC-bisimilarity, is captured by the infinitary modal logic IMLC including two modalities, Direct ${\cal N}$ and Converse ${\cal N}$, corresponding to the two closure operators. (iii) CoPa-bisimilarity on quasi-discrete closure models, which is weaker than CMC-bisimilarity, is based on the notion of compatible paths. The logical counterpart of CoPa-bisimilarity is the infinitary modal logic ICRL with modalities Direct $ζ$ and Converse $ζ$, whose semantics relies on forward and backward paths, respectively. It is shown that CoPa-bisimilarity for quasi-discrete closure models relates to divergence-blind stuttering equivalence for Kripke models.


    Volume: Volume 21, Issue 3
    Published on: August 26, 2025
    Accepted on: June 24, 2025
    Submitted on: January 30, 2023
    Keywords: Logic in Computer Science

    Consultation statistics

    This page has been seen 840 times.
    This article's PDF has been downloaded 160 times.