Author:
ROT JURRIAAN,BONCHI FILIPPO,BONSANGUE MARCELLO,POUS DAMIEN,RUTTEN JAN,SILVA ALEXANDRA
Abstract
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bisimulation proof method for a large class of state based systems, including labelled transition systems but also stream systems and weighted automata. Our approach allows for compositional reasoning about the soundness of enhancements. Applications include the soundness of bisimulation up to bisimilarity, up to equivalence and up to congruence. All in all, this gives a powerful and modular framework for simplified coinductive proofs of equivalence.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference44 articles.
1. Calculi for synchrony and asynchrony
2. On the bisimulation proof method
3. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads;Lenisa;ENTCS,2000
4. Behavioural differential equations: a coinductive calculus of streams, automata, and power series
5. A linear algorithm for testing equivalence of finite automata;Hopcroft;Technical Report,1971
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献