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

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

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

Interacting bialgebras are Frobenius F Bonchi, P Sobociński, F Zanasi International Conference on Foundations of Software Science and Computation …, 2014 | 33 | 2014 |

Interacting Hopf Algebras: the theory of linear systems F Zanasi arXiv preprint arXiv:1805.03032, 2018 | 30 | 2018 |

A predicate/state transformer semantics for Bayesian learning B Jacobs, F Zanasi Electronic Notes in Theoretical Computer Science 325, 185-200, 2016 | 29 | 2016 |

Rewriting modulo symmetric monoidal structure F Bonchi, F Gadducci, A Kissinger, P Sobociński, F Zanasi 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016 | 27 | 2016 |

The logical essentials of Bayesian reasoning B Jacobs, F Zanasi arXiv preprint arXiv:1804.01193, 2018 | 16 | 2018 |

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 | 16 | 2017 |

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure F Bonchi, S Milius, A Silva, F Zanasi Theoretical Computer Science 604, 102-126, 2015 | 13 | 2015 |

A formal semantics of influence in Bayesian reasoning B Jacobs, F Zanasi Dagstuhl: LIPICS, 2017 | 12 | 2017 |

Bialgebraic semantics for logic programming F Bonchi, F Zanasi arXiv preprint arXiv:1502.06095, 2015 | 12 | 2015 |

Concurrent Kleene algebra: free model and completeness T Kappé, P Brunet, A Silva, F Zanasi European Symposium on Programming, 856-882, 2018 | 11 | 2018 |

Saturated semantics for coalgebraic logic programming F Bonchi, F Zanasi International Conference on Algebra and Coalgebra in Computer Science, 80-94, 2013 | 11 | 2013 |

A characterization theorem for the alternation-free fragment of the modal µ-calculus A Facchini, Y Venema, F Zanasi 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 478-487, 2013 | 10 | 2013 |

Weak MSO: Automata and expressiveness modulo bisimilarity F Carreiro, A Facchini, Y Venema, F Zanasi Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 9 | 2014 |

The algebra of partial equivalence relations F Zanasi Electronic Notes in Theoretical Computer Science 325, 313-333, 2016 | 8 | 2016 |

How to kill epsilons with a dagger F Bonchi, S Milius, A Silva, F Zanasi International Workshop on Coalgebraic Methods in Computer Science, 53-74, 2014 | 8 | 2014 |

Lawvere categories as composed PROPs F Bonchi, P Sobocinski, F Zanasi International Workshop on Coalgebraic Methods in Computer Science, 11-32, 2016 | 7* | 2016 |

Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree F Zanasi University of Amsterdam, Institute for Logic, Language and Computation, 2012 | 7 | 2012 |