Weak simplicial bisimilarity and minimisation for polyhedral model checking

DOI10.46298/LMCS-22(1:6)2026MaRDI QIDQ6858371zbMATH OpenFDO

Authors Nick Bezhanishvili, Vincenzo Ciancia, David Gabelaia, M. Jibladze, Diego Latella, Mieke Massink, Erik de Vink

Publication date 13 February 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:6)2026

zbMATH Keywords

bisimulation relationslogical equivalencemodel minimisationpolyhedral modelsspatial bisimilarityspatial logicsspatial model checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A Spatial Logic for Simplicial Models
• An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
• Back-and-forth in space: on logics and bisimilarity in closure spaces
• Branching time and abstraction in bisimulation semantics
• Geometric Model Checking of Continuous Space
• Handbook of Spatial Logics
• scientific article; zbMATH DE number 3228406 (Why is no real title available?)
• Minimisation of spatial models using branching bisimilarity
• Model checking spatial logics for closure spaces
• On bisimilarity for quasi-discrete closure spaces
• Qualitative and quantitative monitoring of spatio-temporal properties with SSTL
• SpaTeL: a novel spatial-temporal logic and its applications to networked systems
• Specifying and Verifying Properties of Space
• Tarski's theorem on intuitionistic logic, for polyhedra

This page was built for publication: Weak simplicial bisimilarity and minimisation for polyhedral model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858371)