Minimisation of spatial models using branching bisimilarity
DOI10.1007/978-3-031-27481-7_16zbMath1529.68155OpenAlexW4323026818MaRDI QIDQ6174538
Mieke Massink, Diego Latella, Jan Friso Groote, E. P. de Vink, Vincenzo Ciancia
Publication date: 17 August 2023
Published in: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-27481-7_16
closure spacesspatial logicsbranching bisimilarityspatial model checkingspatial bisimilarityspatial minimisation
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- A generalized topological view of motion in discrete space.
- A spatial logic for concurrency. I
- Model Checking Spatial Logics for Closure Spaces
- SpaTeL
- Specifying and Verifying Properties of Space
- Handbook of Spatial Logics
- The Space and Motion of Communicating Agents
- Branching time and abstraction in bisimulation semantics
- A spatial similarity measure based on games: theory and practice
- Geometric Model Checking of Continuous Space
- Analysing Spatial Properties on Neighbourhood Spaces
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems
- Anytime, anywhere
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- A Spatial Logic for Simplicial Models
- Embedding RCC8D in the collective spatial logic CSLCS
This page was built for publication: Minimisation of spatial models using branching bisimilarity
