Minimisation of spatial models using branching bisimilarity
From MaRDI portal
Recommendations
Cites work
- A generalized topological view of motion in discrete space.
- A spatial logic for concurrency. I
- A Spatial Logic for Simplicial Models
- A spatial similarity measure based on games: theory and practice
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
- Analysing Spatial Properties on Neighbourhood Spaces
- Anytime, anywhere: modal logics for mobile ambients
- Branching time and abstraction in bisimulation semantics
- Embedding RCC8D in the collective spatial logic CSLCS
- Geometric Model Checking of Continuous Space
- Handbook of Spatial Logics
- scientific article; zbMATH DE number 3228406 (Why is no real title available?)
- Model checking spatial logics for 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
- The Space and Motion of Communicating Agents
Cited in
(5)
This page was built for publication: Minimisation of spatial models using branching bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174538)