Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1017/S0960129515000523 | MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE |
DocType | Volume | Issue |
Journal | 27 | SP7 |
ISSN | Citations | PageRank |
0960-1295 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jurriaan Rot | 1 | 104 | 18.53 |
| Filippo Bonchi | 2 | 579 | 47.04 |
| M. M. Bonsangue | 3 | 59 | 7.78 |
| Damien Pous | 4 | 240 | 31.00 |
| Jan Rutten | 5 | 0 | 0.34 |
| Alexandra Silva | 6 | 20 | 6.76 |