| Checking NFA equivalence with bisimulations up to congruence F Bonchi, D Pous ACM SIGPLAN Notices 48 (1), 457-468, 2013 | 213 | 2013 |
| Interacting hopf algebras F Bonchi, P Sobociński, F Zanasi Journal of Pure and Applied Algebra 221 (1), 144-184, 2017 | 116 | 2017 |
| A categorical semantics of signal flow graphs F Bonchi, P Sobociński, F Zanasi International Conference on Concurrency Theory, 435-450, 2014 | 114 | 2014 |
| Full abstraction for signal flow graphs F Bonchi, P Sobocinski, F Zanasi ACM SIGPLAN Notices 50 (1), 515-526, 2015 | 107 | 2015 |
| Generalizing determinization from automata to coalgebras A Silva, F Bonchi, M Bonsangue, J Rutten Logical Methods in Computer Science 9, 2013 | 107 | 2013 |
| Generalizing the powerset construction, coalgebraically A Silva, F Bonchi, MM Bonsangue, JJMM Rutten IARCS Annual Conference on Foundations of Software Technology and …, 2010 | 80 | 2010 |
| Saturated semantics for reactive systems F Bonchi, B Konig, U Montanari 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 69-80, 2006 | 80 | 2006 |
| Diagrammatic algebra: from linear to concurrent systems F Bonchi, J Holland, R Piedeleu, P Sobociński, F Zanasi Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 71 | 2019 |
| A coalgebraic perspective on linear weighted automata F Bonchi, M Bonsangue, M Boreale, J Rutten, A Silva Information and Computation 211, 77-105, 2012 | 71 | 2012 |
| Graphical affine algebra F Bonchi, R Piedeleu, P Sobociński, F Zanasi 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019 | 68 | 2019 |
| Rewriting modulo symmetric monoidal structure F Bonchi, F Gadducci, A Kissinger, P Sobociński, F Zanasi Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 68 | 2016 |
| A coalgebraic perspective on minimization and determinization J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva Foundations of Software Science and Computational Structures: 15th …, 2012 | 67 | 2012 |
| Algebra-coalgebra duality in Brzozowski's minimization algorithm F Bonchi, MM Bonsangue, HH Hansen, P Panangaden, JJMM Rutten, ... ACM Transactions on Computational Logic (TOCL) 15 (1), 1-29, 2014 | 66 | 2014 |
| The calculus of signal flow diagrams I: linear relations on streams F Bonchi, P Sobociński, F Zanasi Information and Computation 252, 2-29, 2017 | 65 | 2017 |
| Coinduction up-to in a fibrational setting F Bonchi, D Petrişan, D Pous, J Rot Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 62 | 2014 |
| Coalgebraic behavioral metrics P Baldan, F Bonchi, H Kerstan, B König Logical Methods in Computer Science 14, 2018 | 59 | 2018 |
| Reactive systems, barbed semantics, and the mobile ambients F Bonchi, F Gadducci, GV Monreale International Conference on Foundations of Software Science and …, 2009 | 51 | 2009 |
| String diagram rewrite theory I: Rewriting with Frobenius structure F Bonchi, F Gadducci, A Kissinger, P Sobocinski, F Zanasi Journal of the ACM (JACM) 69 (2), 1-58, 2022 | 50 | 2022 |
| A general account of coinduction up-to F Bonchi, D Petrişan, D Pous, J Rot Acta Informatica 54, 127-190, 2017 | 50 | 2017 |
| A behavioural congruence for web services F Bonchi, A Brogi, S Corfini, F Gadducci International Symposium on Fundamentals of Software Engineering …, 2007 | 47 | 2007 |
