Sound and complete axiomatizations are provided for path-reachability logic with Cantor derivative in T1 topologies and metric spaces, with decidability via neighborhood semantics that yields the finite model property.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Encoding closure models as LTS enables branching bisimilarity minimisation to compute CoPa equivalence classes, with a toolchain demonstrating faster spatial model checking on images.
citing papers explorer
-
Topological Logics of Path-Reachability
Sound and complete axiomatizations are provided for path-reachability logic with Cantor derivative in T1 topologies and metric spaces, with decidability via neighborhood semantics that yields the finite model property.
-
Spatial Model Checking of Images via Minimised Models and Branching Bisimilarity
Encoding closure models as LTS enables branching bisimilarity minimisation to compute CoPa equivalence classes, with a toolchain demonstrating faster spatial model checking on images.