Repository landing page
Coinduction up to in a fibrational setting
Abstract
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting, building on the seminal work of Hermida and Jacobs. This allows us to systematically obtain up-to techniques not only for bisimilarity but for a large class of coinductive predicates modelled as coalgebras. By tuning the parameters of our framework, we obtain novel techniques for unary predicates and nominal automata, a variant of the GSOS rule format for similarity, and a new categorical treatment of weak bisimilarity- info:eu-repo/semantics/conferenceObject
- Conference papers
- nominal automata
- bisimulation up-to
- coalgebra
- GSOS
- fibrations
- coinductive predicates
- up-to techniques
- similarity
- F3; F4
- [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
- [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]