Checking NFA equivalence with bisimulations up to congruence F Bonchi, D Pous ACM SIGPLAN Notices 48 (1), 457-468, 2013 | 178 | 2013 |

A categorical semantics of signal flow graphs F Bonchi, P Sobociński, F Zanasi International Conference on Concurrency Theory, 435-450, 2014 | 92 | 2014 |

Full abstraction for signal flow graphs F Bonchi, P Sobocinski, F Zanasi ACM SIGPLAN Notices 50 (1), 515-526, 2015 | 85 | 2015 |

Generalizing determinization from automata to coalgebras A Silva, F Bonchi, M Bonsangue, J Rutten arXiv preprint arXiv:1302.1046, 2013 | 84 | 2013 |

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 | 79 | 2006 |

Interacting hopf algebras F Bonchi, P Sobociński, F Zanasi Journal of Pure and Applied Algebra 221 (1), 144-184, 2017 | 78 | 2017 |

Generalizing the powerset construction, coalgebraically A Silva, F Bonchi, MM Bonsangue, JJMM Rutten IARCS Annual Conference on Foundations of Software Technology and …, 2010 | 74 | 2010 |

A coalgebraic perspective on minimization and determinization J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva International Conference on Foundations of Software Science and …, 2012 | 66 | 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 | 62 | 2014 |

A coalgebraic perspective on linear weighted automata F Bonchi, M Bonsangue, M Boreale, J Rutten, A Silva Information and Computation 211, 77-105, 2012 | 58 | 2012 |

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 | 56 | 2014 |

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 | 50 | 2016 |

Reactive systems, barbed semantics, and the mobile ambients F Bonchi, F Gadducci, GV Monreale International Conference on Foundations of Software Science and …, 2009 | 48 | 2009 |

A behavioural congruence for web services F Bonchi, A Brogi, S Corfini, F Gadducci International Conference on Fundamentals of Software Engineering, 240-256, 2007 | 47 | 2007 |

Interacting bialgebras are Frobenius F Bonchi, P Sobociński, F Zanasi International Conference on Foundations of Software Science and Computation …, 2014 | 43 | 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 | 42 | 2017 |

A general account of coinduction up-to F Bonchi, D Petrişan, D Pous, J Rot Acta Informatica 54 (2), 127-190, 2017 | 37 | 2017 |

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 | 36 | 2019 |

The power of convex algebras F Bonchi, A Silva, A Sokolova 28th International Conference on Concurrency Theory (CONCUR 2017), 2017 | 35 | 2017 |

Brzozowski’s algorithm (co) algebraically F Bonchi, MM Bonsangue, JJMM Rutten, A Silva Logic and Program Semantics, 12-23, 2012 | 35 | 2012 |