Coinduction up-to in a fibrational setting

From MaRDI portal
Publication:4635603

DOI10.1145/2603088.2603149zbMATH Open1395.68195arXiv1401.6675OpenAlexW2077019667MaRDI QIDQ4635603FDOQ4635603

Daniela Petrişan, Jurriaan Rot, Filippo Bonchi, Damien Pous

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Abstract: Bisimulation 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.


Full work available at URL: https://arxiv.org/abs/1401.6675






Cited In (25)






This page was built for publication: Coinduction up-to in a fibrational setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635603)