2000 character limit reached
Generalized Vietoris Bisimulations
Published 15 Dec 2014 in cs.LO and math.LO | (1412.4586v1)
Abstract: We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [4]. The main result of our paper is that bisimulation for a coalgebra is the topological closure of bisimulation for the underlying coalgebra.
Paper Prompts
Sign up for free to create and run prompts on this paper.